TSTP Solution File: LCL893+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL893+1 : TPTP v8.1.0. Released v5.5.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 : Sun Jul 17 10:18:30 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 21 unt; 0 def)
% Number of atoms : 52 ( 24 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 31 ( 13 ~; 10 |; 3 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 53 ( 7 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos_03,axiom,
! [X1] : '+'(X1,'0') = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_03) ).
fof(sos_02,axiom,
! [X1,X2] : '+'(X1,X2) = '+'(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_02) ).
fof(sos_10,axiom,
! [X12,X13,X14] :
( '>='(X12,X13)
=> '>='('+'(X12,X14),'+'(X13,X14)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_10) ).
fof(sos_09,axiom,
! [X1] : '>='(X1,'0'),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_09) ).
fof(goals_15,conjecture,
! [X21] :
( h(X21) = X21
=> X21 = '0' ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals_15) ).
fof(sos_07,axiom,
! [X7,X8] :
( ( '>='(X7,X8)
& '>='(X8,X7) )
=> X7 = X8 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_07) ).
fof(sos_08,axiom,
! [X9,X10,X11] :
( '>='('+'(X9,X10),X11)
<=> '>='(X10,'==>'(X9,X11)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_08) ).
fof(sos_14,axiom,
! [X1] : h(X1) = '==>'(h(X1),X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_14) ).
fof(c_0_8,plain,
! [X2] : '+'(X2,'0') = X2,
inference(variable_rename,[status(thm)],[sos_03]) ).
fof(c_0_9,plain,
! [X3,X4] : '+'(X3,X4) = '+'(X4,X3),
inference(variable_rename,[status(thm)],[sos_02]) ).
fof(c_0_10,plain,
! [X15,X16,X17] :
( ~ '>='(X15,X16)
| '>='('+'(X15,X17),'+'(X16,X17)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_10])])])]) ).
cnf(c_0_11,plain,
'+'(X1,'0') = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
'+'(X1,X2) = '+'(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X2] : '>='(X2,'0'),
inference(variable_rename,[status(thm)],[sos_09]) ).
cnf(c_0_14,plain,
( '>='('+'(X1,X2),'+'(X3,X2))
| ~ '>='(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
'+'('0',X1) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
'>='(X1,'0'),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,negated_conjecture,
~ ! [X21] :
( h(X21) = X21
=> X21 = '0' ),
inference(assume_negation,[status(cth)],[goals_15]) ).
fof(c_0_18,plain,
! [X9,X10] :
( ~ '>='(X9,X10)
| ~ '>='(X10,X9)
| X9 = X10 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])]) ).
fof(c_0_19,plain,
! [X12,X13,X14,X12,X13,X14] :
( ( ~ '>='('+'(X12,X13),X14)
| '>='(X13,'==>'(X12,X14)) )
& ( ~ '>='(X13,'==>'(X12,X14))
| '>='('+'(X12,X13),X14) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_08])])])]) ).
cnf(c_0_20,plain,
'>='('+'(X1,X2),X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
fof(c_0_21,plain,
! [X2] : h(X2) = '==>'(h(X2),X2),
inference(variable_rename,[status(thm)],[sos_14]) ).
fof(c_0_22,negated_conjecture,
( h(esk1_0) = esk1_0
& esk1_0 != '0' ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
cnf(c_0_23,plain,
( X1 = X2
| ~ '>='(X2,X1)
| ~ '>='(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X2,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
'>='('+'(X1,X2),X1),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_26,plain,
h(X1) = '==>'(h(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
h(esk1_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( '0' = X1
| ~ '>='('0',X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_29,plain,
'>='(X1,'==>'(X2,X2)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
'==>'(esk1_0,esk1_0) = esk1_0,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
'==>'(X1,X1) = '0',
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
esk1_0 != '0',
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL893+1 : TPTP v8.1.0. Released v5.5.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 3 02:30:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.014 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 34
% 0.22/1.40 # Proof object clause steps : 17
% 0.22/1.40 # Proof object formula steps : 17
% 0.22/1.40 # Proof object conjectures : 7
% 0.22/1.40 # Proof object clause conjectures : 4
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 9
% 0.22/1.40 # Proof object initial formulas used : 8
% 0.22/1.40 # Proof object generating inferences : 7
% 0.22/1.40 # Proof object simplifying inferences : 4
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 15
% 0.22/1.40 # Removed by relevancy pruning/SinE : 1
% 0.22/1.40 # Initial clauses : 16
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 16
% 0.22/1.40 # Processed clauses : 63
% 0.22/1.40 # ...of these trivial : 4
% 0.22/1.40 # ...subsumed : 15
% 0.22/1.40 # ...remaining for further processing : 44
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 4
% 0.22/1.40 # Generated clauses : 448
% 0.22/1.40 # ...of the previous two non-trivial : 362
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 448
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 40
% 0.22/1.40 # Positive orientable unit clauses : 15
% 0.22/1.40 # Positive unorientable unit clauses: 4
% 0.22/1.40 # Negative unit clauses : 1
% 0.22/1.40 # Non-unit-clauses : 20
% 0.22/1.40 # Current number of unprocessed clauses: 297
% 0.22/1.40 # ...number of literals in the above : 557
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 4
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 42
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 42
% 0.22/1.40 # Non-unit clause-clause subsumptions : 11
% 0.22/1.40 # Unit Clause-clause subsumption calls : 30
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 40
% 0.22/1.40 # BW rewrite match successes : 12
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 4041
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.020 s
% 0.22/1.40 # System time : 0.001 s
% 0.22/1.40 # Total time : 0.021 s
% 0.22/1.40 # Maximum resident set size: 3056 pages
%------------------------------------------------------------------------------