TSTP Solution File: NUM571+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM571+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 09:33:55 EDT 2022
% Result : Theorem 0.26s 1.43s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 52 ( 16 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 47 ( 12 ~; 14 |; 18 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 3 ( 0 sgn 2 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__3702_02,hypothesis,
( xi != sz00
=> ( ? [X1] :
( aElementOf0(X1,szNzAzT0)
& szszuzczcdt0(X1) = xi )
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3702_02) ).
fof(m__3623,hypothesis,
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) )
=> ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))
& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1))) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3623) ).
fof(m__3435,hypothesis,
( aSubsetOf0(xS,szNzAzT0)
& isCountable0(xS) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__3435) ).
fof(c_0_4,negated_conjecture,
~ ( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
fof(c_0_6,hypothesis,
( ( aElementOf0(esk3_0,szNzAzT0)
| xi = sz00 )
& ( szszuzczcdt0(esk3_0) = xi
| xi = sz00 )
& ( aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
| xi = sz00 )
& ( isCountable0(sdtlpdtrp0(xN,xi))
| xi = sz00 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3702_02])])])])])]) ).
fof(c_0_7,hypothesis,
! [X2] :
( aFunction0(xN)
& szDzozmdt0(xN) = szNzAzT0
& sdtlpdtrp0(xN,sz00) = xS
& ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ~ aElementOf0(X2,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X2)))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X2),szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X2))
| ~ aElementOf0(X2,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3623])])])])])]) ).
cnf(c_0_8,negated_conjecture,
( ~ isCountable0(sdtlpdtrp0(xN,xi))
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
( xi = sz00
| isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,hypothesis,
( xi = sz00
| aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
sz00 = xi,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_13,hypothesis,
sdtlpdtrp0(xN,xi) = xS,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_15,hypothesis,
isCountable0(xS),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_13]),c_0_14]),c_0_13]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM571+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jul 6 15:07:08 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.26/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.43 # Preprocessing time : 0.025 s
% 0.26/1.43
% 0.26/1.43 # Proof found!
% 0.26/1.43 # SZS status Theorem
% 0.26/1.43 # SZS output start CNFRefutation
% See solution above
% 0.26/1.43 # Proof object total steps : 17
% 0.26/1.43 # Proof object clause steps : 9
% 0.26/1.43 # Proof object formula steps : 8
% 0.26/1.43 # Proof object conjectures : 6
% 0.26/1.43 # Proof object clause conjectures : 3
% 0.26/1.43 # Proof object formula conjectures : 3
% 0.26/1.43 # Proof object initial clauses used : 6
% 0.26/1.43 # Proof object initial formulas used : 4
% 0.26/1.43 # Proof object generating inferences : 1
% 0.26/1.43 # Proof object simplifying inferences : 7
% 0.26/1.43 # Training examples: 0 positive, 0 negative
% 0.26/1.43 # Parsed axioms : 85
% 0.26/1.43 # Removed by relevancy pruning/SinE : 5
% 0.26/1.43 # Initial clauses : 154
% 0.26/1.43 # Removed in clause preprocessing : 7
% 0.26/1.43 # Initial clauses in saturation : 147
% 0.26/1.43 # Processed clauses : 150
% 0.26/1.43 # ...of these trivial : 0
% 0.26/1.43 # ...subsumed : 1
% 0.26/1.43 # ...remaining for further processing : 149
% 0.26/1.43 # Other redundant clauses eliminated : 11
% 0.26/1.43 # Clauses deleted for lack of memory : 0
% 0.26/1.43 # Backward-subsumed : 0
% 0.26/1.43 # Backward-rewritten : 19
% 0.26/1.43 # Generated clauses : 440
% 0.26/1.43 # ...of the previous two non-trivial : 408
% 0.26/1.43 # Contextual simplify-reflections : 17
% 0.26/1.43 # Paramodulations : 412
% 0.26/1.43 # Factorizations : 0
% 0.26/1.43 # Equation resolutions : 28
% 0.26/1.43 # Current number of processed clauses : 127
% 0.26/1.43 # Positive orientable unit clauses : 18
% 0.26/1.43 # Positive unorientable unit clauses: 0
% 0.26/1.43 # Negative unit clauses : 0
% 0.26/1.43 # Non-unit-clauses : 109
% 0.26/1.43 # Current number of unprocessed clauses: 314
% 0.26/1.43 # ...number of literals in the above : 1681
% 0.26/1.43 # Current number of archived formulas : 0
% 0.26/1.43 # Current number of archived clauses : 19
% 0.26/1.43 # Clause-clause subsumption calls (NU) : 4721
% 0.26/1.43 # Rec. Clause-clause subsumption calls : 605
% 0.26/1.43 # Non-unit clause-clause subsumptions : 17
% 0.26/1.43 # Unit Clause-clause subsumption calls : 23
% 0.26/1.43 # Rewrite failures with RHS unbound : 0
% 0.26/1.43 # BW rewrite match attempts : 2
% 0.26/1.43 # BW rewrite match successes : 2
% 0.26/1.43 # Condensation attempts : 0
% 0.26/1.43 # Condensation successes : 0
% 0.26/1.43 # Termbank termtop insertions : 18495
% 0.26/1.43
% 0.26/1.43 # -------------------------------------------------
% 0.26/1.43 # User time : 0.039 s
% 0.26/1.43 # System time : 0.005 s
% 0.26/1.43 # Total time : 0.044 s
% 0.26/1.43 # Maximum resident set size: 4200 pages
% 0.26/23.44 eprover: CPU time limit exceeded, terminating
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.46 eprover: No such file or directory
% 0.26/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.46 eprover: No such file or directory
% 0.26/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.47 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.49 eprover: No such file or directory
% 0.26/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.49 eprover: No such file or directory
% 0.26/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.50 eprover: No such file or directory
% 0.26/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.50 eprover: No such file or directory
% 0.26/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.51 eprover: No such file or directory
%------------------------------------------------------------------------------