TSTP Solution File: LCL897-10 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL897-10 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:23:03 EDT 2023
% Result : Unsatisfiable 380.39s 49.43s
% Output : CNFRefutation 380.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of clauses : 40 ( 40 unt; 0 nHn; 5 RR)
% Number of literals : 40 ( 39 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 85 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sos_07,axiom,
' = =>'('+'(X1,X2),X3) = ' = =>'(X1,' = =>'(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.moPnvSRSwi/E---3.1_30321.p',sos_07) ).
cnf(sos_02,axiom,
'+'(X1,X2) = '+'(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.moPnvSRSwi/E---3.1_30321.p',sos_02) ).
cnf(sos_04,axiom,
' = =>'(X1,X1) = '0',
file('/export/starexec/sandbox/tmp/tmp.moPnvSRSwi/E---3.1_30321.p',sos_04) ).
cnf(sos_05,axiom,
' = =>'(X1,'0') = '0',
file('/export/starexec/sandbox/tmp/tmp.moPnvSRSwi/E---3.1_30321.p',sos_05) ).
cnf(sos_08,axiom,
'+'(X1,' = =>'(X1,X2)) = '+'(X2,' = =>'(X2,X1)),
file('/export/starexec/sandbox/tmp/tmp.moPnvSRSwi/E---3.1_30321.p',sos_08) ).
cnf(sos_01,axiom,
'+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.moPnvSRSwi/E---3.1_30321.p',sos_01) ).
cnf(sos_03,axiom,
'+'(X1,'0') = X1,
file('/export/starexec/sandbox/tmp/tmp.moPnvSRSwi/E---3.1_30321.p',sos_03) ).
cnf(goals_09,negated_conjecture,
'+'('+'(a,' = =>'(a,b)),' = =>'('+'(a,' = =>'(a,b)),c)) != '+'(a,' = =>'(a,'+'(b,' = =>'(b,c)))),
file('/export/starexec/sandbox/tmp/tmp.moPnvSRSwi/E---3.1_30321.p',goals_09) ).
cnf(c_0_8,axiom,
' = =>'('+'(X1,X2),X3) = ' = =>'(X1,' = =>'(X2,X3)),
sos_07 ).
cnf(c_0_9,axiom,
'+'(X1,X2) = '+'(X2,X1),
sos_02 ).
cnf(c_0_10,plain,
' = =>'(X1,' = =>'(X2,X3)) = ' = =>'(X2,' = =>'(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_8]) ).
cnf(c_0_11,axiom,
' = =>'(X1,X1) = '0',
sos_04 ).
cnf(c_0_12,axiom,
' = =>'(X1,'0') = '0',
sos_05 ).
cnf(c_0_13,axiom,
'+'(X1,' = =>'(X1,X2)) = '+'(X2,' = =>'(X2,X1)),
sos_08 ).
cnf(c_0_14,axiom,
'+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
sos_01 ).
cnf(c_0_15,plain,
' = =>'(X1,' = =>'(X2,X1)) = '0',
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_16,plain,
'+'(X1,'+'(X2,' = =>'(X1,' = =>'(X2,X3)))) = '+'(X3,' = =>'(X3,'+'(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_8]) ).
cnf(c_0_17,plain,
' = =>'(X1,' = =>'(X2,' = =>'(X3,X1))) = '0',
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_15]),c_0_12]) ).
cnf(c_0_18,plain,
' = =>'(X1,' = =>'(X2,' = =>'(' = =>'(X1,' = =>'(X2,X3)),X4))) = ' = =>'(X3,' = =>'(' = =>'(X3,'+'(X1,X2)),X4)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_16]),c_0_8]),c_0_8]) ).
cnf(c_0_19,plain,
'+'(X1,' = =>'(X2,' = =>'(X1,X3))) = '+'(' = =>'(X2,X3),' = =>'(' = =>'(X2,X3),X1)),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_20,plain,
' = =>'(X1,' = =>'(' = =>'(X1,'+'(X2,X3)),X2)) = '0',
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
'+'(X1,'0') = X1,
sos_03 ).
cnf(c_0_22,plain,
' = =>'(X1,' = =>'(X2,'+'(X1,X2))) = '0',
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_23,plain,
'+'(' = =>'(X1,X2),' = =>'(X1,' = =>'(' = =>'(X1,X2),'+'(X2,X3)))) = ' = =>'(X1,'+'(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_10]) ).
cnf(c_0_24,plain,
' = =>'(X1,' = =>'(' = =>'(X1,X2),'+'(X2,' = =>'(X2,X1)))) = '0',
inference(spm,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_25,plain,
' = =>'(X1,'+'(X2,' = =>'(X2,X1))) = ' = =>'(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21]) ).
cnf(c_0_26,plain,
' = =>'(X1,'+'(X1,' = =>'(X1,X2))) = ' = =>'(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_27,plain,
' = =>'(X1,' = =>'(' = =>'(X1,X2),X3)) = ' = =>'(X2,' = =>'(' = =>'(X2,X1),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_13]),c_0_8]) ).
cnf(c_0_28,plain,
' = =>'(X1,' = =>'(X2,'+'(X1,' = =>'(X1,X3)))) = ' = =>'(X2,' = =>'(X1,X3)),
inference(spm,[status(thm)],[c_0_10,c_0_26]) ).
cnf(c_0_29,plain,
'+'(X1,'+'(' = =>'(X1,X2),X3)) = '+'(X2,'+'(' = =>'(X2,X1),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_13]),c_0_14]) ).
cnf(c_0_30,plain,
' = =>'(X1,' = =>'(' = =>'(X1,X2),'+'(X2,' = =>'(X2,X3)))) = ' = =>'(X2,' = =>'(' = =>'(X2,X1),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_10]) ).
cnf(c_0_31,negated_conjecture,
'+'('+'(a,' = =>'(a,b)),' = =>'('+'(a,' = =>'(a,b)),c)) != '+'(a,' = =>'(a,'+'(b,' = =>'(b,c)))),
goals_09 ).
cnf(c_0_32,plain,
'+'(X1,'+'(' = =>'(X1,X2),' = =>'(X2,' = =>'(' = =>'(X2,X1),X3)))) = '+'(X3,' = =>'(X3,'+'(X2,' = =>'(X2,X1)))),
inference(spm,[status(thm)],[c_0_16,c_0_29]) ).
cnf(c_0_33,plain,
'+'(' = =>'(X1,X2),' = =>'(X2,' = =>'(' = =>'(X2,X1),X3))) = ' = =>'(X1,'+'(X2,' = =>'(X2,X3))),
inference(spm,[status(thm)],[c_0_23,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
'+'(c,' = =>'(c,'+'(a,' = =>'(a,b)))) != '+'(a,' = =>'(a,'+'(b,' = =>'(b,c)))),
inference(rw,[status(thm)],[c_0_31,c_0_13]) ).
cnf(c_0_35,plain,
'+'(X1,' = =>'(X1,'+'(X2,' = =>'(X2,X3)))) = '+'(X3,' = =>'(X3,'+'(X2,' = =>'(X2,X1)))),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
'+'(X1,'+'(' = =>'(X1,X2),' = =>'(X2,' = =>'(' = =>'(X2,X1),X3)))) = '+'(X3,' = =>'(X3,'+'(X1,' = =>'(X1,X2)))),
inference(spm,[status(thm)],[c_0_16,c_0_27]) ).
cnf(c_0_37,negated_conjecture,
'+'(b,' = =>'(b,'+'(a,' = =>'(a,c)))) != '+'(a,' = =>'(a,'+'(b,' = =>'(b,c)))),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
'+'(X1,' = =>'(X1,'+'(X2,' = =>'(X2,X3)))) = '+'(X3,' = =>'(X3,'+'(X1,' = =>'(X1,X2)))),
inference(rw,[status(thm)],[c_0_36,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : LCL897-10 : TPTP v8.1.2. Released v8.1.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 13:03:19 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.moPnvSRSwi/E---3.1_30321.p
% 380.39/49.43 # Version: 3.1pre001
% 380.39/49.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 380.39/49.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 380.39/49.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 380.39/49.43 # Starting new_bool_3 with 300s (1) cores
% 380.39/49.43 # Starting new_bool_1 with 300s (1) cores
% 380.39/49.43 # Starting sh5l with 300s (1) cores
% 380.39/49.43 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 30413 completed with status 0
% 380.39/49.43 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 380.39/49.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 380.39/49.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 380.39/49.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 380.39/49.43 # No SInE strategy applied
% 380.39/49.43 # Search class: FUUPM-FFSF22-MFFFFFNN
% 380.39/49.43 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 380.39/49.43 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 380.39/49.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 380.39/49.43 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 380.39/49.43 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 380.39/49.43 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 380.39/49.43 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 30424 completed with status 0
% 380.39/49.43 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 380.39/49.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 380.39/49.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 380.39/49.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 380.39/49.43 # No SInE strategy applied
% 380.39/49.43 # Search class: FUUPM-FFSF22-MFFFFFNN
% 380.39/49.43 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 380.39/49.43 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 380.39/49.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 380.39/49.43 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 380.39/49.43 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 380.39/49.43 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 380.39/49.43 # Preprocessing time : 0.001 s
% 380.39/49.43
% 380.39/49.43 # Proof found!
% 380.39/49.43 # SZS status Unsatisfiable
% 380.39/49.43 # SZS output start CNFRefutation
% See solution above
% 380.39/49.43 # Parsed axioms : 9
% 380.39/49.43 # Removed by relevancy pruning/SinE : 0
% 380.39/49.43 # Initial clauses : 9
% 380.39/49.43 # Removed in clause preprocessing : 0
% 380.39/49.43 # Initial clauses in saturation : 9
% 380.39/49.43 # Processed clauses : 12587
% 380.39/49.43 # ...of these trivial : 7745
% 380.39/49.43 # ...subsumed : 3719
% 380.39/49.43 # ...remaining for further processing : 1123
% 380.39/49.43 # Other redundant clauses eliminated : 0
% 380.39/49.43 # Clauses deleted for lack of memory : 0
% 380.39/49.43 # Backward-subsumed : 0
% 380.39/49.43 # Backward-rewritten : 111
% 380.39/49.43 # Generated clauses : 2010914
% 380.39/49.43 # ...of the previous two non-redundant : 1306487
% 380.39/49.43 # ...aggressively subsumed : 0
% 380.39/49.43 # Contextual simplify-reflections : 0
% 380.39/49.43 # Paramodulations : 2010914
% 380.39/49.43 # Factorizations : 0
% 380.39/49.43 # NegExts : 0
% 380.39/49.43 # Equation resolutions : 0
% 380.39/49.43 # Total rewrite steps : 3506174
% 380.39/49.43 # Propositional unsat checks : 0
% 380.39/49.43 # Propositional check models : 0
% 380.39/49.43 # Propositional check unsatisfiable : 0
% 380.39/49.43 # Propositional clauses : 0
% 380.39/49.43 # Propositional clauses after purity: 0
% 380.39/49.43 # Propositional unsat core size : 0
% 380.39/49.43 # Propositional preprocessing time : 0.000
% 380.39/49.43 # Propositional encoding time : 0.000
% 380.39/49.43 # Propositional solver time : 0.000
% 380.39/49.43 # Success case prop preproc time : 0.000
% 380.39/49.43 # Success case prop encoding time : 0.000
% 380.39/49.43 # Success case prop solver time : 0.000
% 380.39/49.43 # Current number of processed clauses : 1012
% 380.39/49.43 # Positive orientable unit clauses : 917
% 380.39/49.43 # Positive unorientable unit clauses: 95
% 380.39/49.43 # Negative unit clauses : 0
% 380.39/49.43 # Non-unit-clauses : 0
% 380.39/49.43 # Current number of unprocessed clauses: 1293557
% 380.39/49.43 # ...number of literals in the above : 1293557
% 380.39/49.43 # Current number of archived formulas : 0
% 380.39/49.43 # Current number of archived clauses : 111
% 380.39/49.43 # Clause-clause subsumption calls (NU) : 0
% 380.39/49.43 # Rec. Clause-clause subsumption calls : 0
% 380.39/49.43 # Non-unit clause-clause subsumptions : 0
% 380.39/49.43 # Unit Clause-clause subsumption calls : 1916
% 380.39/49.43 # Rewrite failures with RHS unbound : 0
% 380.39/49.43 # BW rewrite match attempts : 222581
% 380.39/49.43 # BW rewrite match successes : 5487
% 380.39/49.43 # Condensation attempts : 0
% 380.39/49.43 # Condensation successes : 0
% 380.39/49.43 # Termbank termtop insertions : 34915015
% 380.39/49.43
% 380.39/49.43 # -------------------------------------------------
% 380.39/49.43 # User time : 44.506 s
% 380.39/49.43 # System time : 1.398 s
% 380.39/49.43 # Total time : 45.904 s
% 380.39/49.43 # Maximum resident set size: 1516 pages
% 380.39/49.43
% 380.39/49.43 # -------------------------------------------------
% 380.39/49.43 # User time : 229.798 s
% 380.39/49.43 # System time : 7.233 s
% 380.39/49.43 # Total time : 237.031 s
% 380.39/49.43 # Maximum resident set size: 1672 pages
% 380.39/49.43 % E---3.1 exiting
% 380.39/49.43 % E---3.1 exiting
%------------------------------------------------------------------------------