TSTP Solution File: NUM540+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM540+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n013.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:34 EDT 2022
% Result : Theorem 0.24s 1.43s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 90 ( 26 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 117 ( 50 ~; 51 |; 11 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 31 ( 3 sgn 14 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefSeg,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( X2 = slbdtrb0(X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
<=> ( aElementOf0(X3,szNzAzT0)
& sdtlseqdt0(szszuzczcdt0(X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefSeg) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefEmp) ).
fof(m__,conjecture,
slbdtrb0(sz00) = slcrc0,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(mNoScLessZr,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ~ sdtlseqdt0(szszuzczcdt0(X1),sz00) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mNoScLessZr) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mZeroNum) ).
fof(c_0_5,plain,
! [X4,X5,X6,X6,X5] :
( ( aSet0(X5)
| X5 != slbdtrb0(X4)
| ~ aElementOf0(X4,szNzAzT0) )
& ( aElementOf0(X6,szNzAzT0)
| ~ aElementOf0(X6,X5)
| X5 != slbdtrb0(X4)
| ~ aElementOf0(X4,szNzAzT0) )
& ( sdtlseqdt0(szszuzczcdt0(X6),X4)
| ~ aElementOf0(X6,X5)
| X5 != slbdtrb0(X4)
| ~ aElementOf0(X4,szNzAzT0) )
& ( ~ aElementOf0(X6,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X6),X4)
| aElementOf0(X6,X5)
| X5 != slbdtrb0(X4)
| ~ aElementOf0(X4,szNzAzT0) )
& ( ~ aElementOf0(esk2_2(X4,X5),X5)
| ~ aElementOf0(esk2_2(X4,X5),szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(esk2_2(X4,X5)),X4)
| ~ aSet0(X5)
| X5 = slbdtrb0(X4)
| ~ aElementOf0(X4,szNzAzT0) )
& ( aElementOf0(esk2_2(X4,X5),szNzAzT0)
| aElementOf0(esk2_2(X4,X5),X5)
| ~ aSet0(X5)
| X5 = slbdtrb0(X4)
| ~ aElementOf0(X4,szNzAzT0) )
& ( sdtlseqdt0(szszuzczcdt0(esk2_2(X4,X5)),X4)
| aElementOf0(esk2_2(X4,X5),X5)
| ~ aSet0(X5)
| X5 = slbdtrb0(X4)
| ~ aElementOf0(X4,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[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)],[mDefSeg])])])])])])]) ).
fof(c_0_6,plain,
! [X3,X4,X3] :
( ( aSet0(X3)
| X3 != slcrc0 )
& ( ~ aElementOf0(X4,X3)
| X3 != slcrc0 )
& ( ~ aSet0(X3)
| aElementOf0(esk1_1(X3),X3)
| X3 = slcrc0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[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)],[mDefEmp])])])])])])]) ).
cnf(c_0_7,plain,
( sdtlseqdt0(szszuzczcdt0(X3),X1)
| ~ aElementOf0(X1,szNzAzT0)
| X2 != slbdtrb0(X1)
| ~ aElementOf0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( X1 = slcrc0
| aElementOf0(esk1_1(X1),X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( aSet0(X2)
| ~ aElementOf0(X1,szNzAzT0)
| X2 != slbdtrb0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,negated_conjecture,
slbdtrb0(sz00) != slcrc0,
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_11,plain,
! [X2] :
( ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X2),sz00) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[mNoScLessZr])])]) ).
cnf(c_0_12,plain,
( X1 = slcrc0
| sdtlseqdt0(szszuzczcdt0(esk1_1(X1)),X2)
| X1 != slbdtrb0(X2)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
fof(c_0_13,negated_conjecture,
slbdtrb0(sz00) != slcrc0,
inference(fof_simplification,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( aElementOf0(X3,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| X2 != slbdtrb0(X1)
| ~ aElementOf0(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( ~ sdtlseqdt0(szszuzczcdt0(X1),sz00)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( slbdtrb0(X1) = slcrc0
| sdtlseqdt0(szszuzczcdt0(esk1_1(slbdtrb0(X1))),X1)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_18,negated_conjecture,
slbdtrb0(sz00) != slcrc0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( X1 = slcrc0
| aElementOf0(esk1_1(X1),szNzAzT0)
| X1 != slbdtrb0(X2)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_8]),c_0_9]) ).
cnf(c_0_20,plain,
~ aElementOf0(esk1_1(slbdtrb0(sz00)),szNzAzT0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_18]) ).
cnf(c_0_21,plain,
( slbdtrb0(X1) = slcrc0
| aElementOf0(esk1_1(slbdtrb0(X1)),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_22,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17])]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM540+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jul 5 21:42:14 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.24/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.43 # Preprocessing time : 0.019 s
% 0.24/1.43
% 0.24/1.43 # Proof found!
% 0.24/1.43 # SZS status Theorem
% 0.24/1.43 # SZS output start CNFRefutation
% See solution above
% 0.24/1.43 # Proof object total steps : 23
% 0.24/1.43 # Proof object clause steps : 13
% 0.24/1.43 # Proof object formula steps : 10
% 0.24/1.43 # Proof object conjectures : 4
% 0.24/1.43 # Proof object clause conjectures : 1
% 0.24/1.43 # Proof object formula conjectures : 3
% 0.24/1.43 # Proof object initial clauses used : 7
% 0.24/1.43 # Proof object initial formulas used : 5
% 0.24/1.43 # Proof object generating inferences : 6
% 0.24/1.43 # Proof object simplifying inferences : 8
% 0.24/1.43 # Training examples: 0 positive, 0 negative
% 0.24/1.43 # Parsed axioms : 52
% 0.24/1.43 # Removed by relevancy pruning/SinE : 5
% 0.24/1.43 # Initial clauses : 81
% 0.24/1.43 # Removed in clause preprocessing : 5
% 0.24/1.43 # Initial clauses in saturation : 76
% 0.24/1.43 # Processed clauses : 171
% 0.24/1.43 # ...of these trivial : 3
% 0.24/1.43 # ...subsumed : 35
% 0.24/1.43 # ...remaining for further processing : 133
% 0.24/1.43 # Other redundant clauses eliminated : 12
% 0.24/1.43 # Clauses deleted for lack of memory : 0
% 0.24/1.43 # Backward-subsumed : 2
% 0.24/1.43 # Backward-rewritten : 1
% 0.24/1.43 # Generated clauses : 305
% 0.24/1.43 # ...of the previous two non-trivial : 262
% 0.24/1.43 # Contextual simplify-reflections : 69
% 0.24/1.43 # Paramodulations : 275
% 0.24/1.43 # Factorizations : 0
% 0.24/1.43 # Equation resolutions : 30
% 0.24/1.43 # Current number of processed clauses : 128
% 0.24/1.43 # Positive orientable unit clauses : 6
% 0.24/1.43 # Positive unorientable unit clauses: 0
% 0.24/1.43 # Negative unit clauses : 4
% 0.24/1.43 # Non-unit-clauses : 118
% 0.24/1.43 # Current number of unprocessed clauses: 167
% 0.24/1.43 # ...number of literals in the above : 1018
% 0.24/1.43 # Current number of archived formulas : 0
% 0.24/1.43 # Current number of archived clauses : 3
% 0.24/1.43 # Clause-clause subsumption calls (NU) : 4594
% 0.24/1.43 # Rec. Clause-clause subsumption calls : 1477
% 0.24/1.43 # Non-unit clause-clause subsumptions : 101
% 0.24/1.43 # Unit Clause-clause subsumption calls : 95
% 0.24/1.43 # Rewrite failures with RHS unbound : 0
% 0.24/1.43 # BW rewrite match attempts : 1
% 0.24/1.43 # BW rewrite match successes : 1
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 10927
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.032 s
% 0.24/1.43 # System time : 0.002 s
% 0.24/1.43 # Total time : 0.034 s
% 0.24/1.43 # Maximum resident set size: 3436 pages
%------------------------------------------------------------------------------