TSTP Solution File: LCL894+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL894+1 : TPTP v8.1.2. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:34:07 EDT 2023
% Result : Theorem 0.21s 0.60s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 12
% Syntax : Number of formulae : 67 ( 30 unt; 0 def)
% Number of atoms : 122 ( 18 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 96 ( 41 ~; 40 |; 7 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 113 ( 9 sgn; 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos_03,axiom,
! [X1] : '+'(X1,'0') = X1,
file('/export/starexec/sandbox2/tmp/tmp.DuXq6pzalO/E---3.1_19262.p',sos_03) ).
fof(sos_02,axiom,
! [X1,X2] : '+'(X1,X2) = '+'(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.DuXq6pzalO/E---3.1_19262.p',sos_02) ).
fof(sos_09,axiom,
! [X12,X13,X14] :
( '>='(X12,X13)
=> '>='('+'(X12,X14),'+'(X13,X14)) ),
file('/export/starexec/sandbox2/tmp/tmp.DuXq6pzalO/E---3.1_19262.p',sos_09) ).
fof(sos_08,axiom,
! [X1] : '>='(X1,'0'),
file('/export/starexec/sandbox2/tmp/tmp.DuXq6pzalO/E---3.1_19262.p',sos_08) ).
fof(sos_05,axiom,
! [X4,X5,X6] :
( ( '>='(X4,X5)
& '>='(X5,X6) )
=> '>='(X4,X6) ),
file('/export/starexec/sandbox2/tmp/tmp.DuXq6pzalO/E---3.1_19262.p',sos_05) ).
fof(goals_13,conjecture,
( ( '>='(c,a)
& '>='(c,b) )
<=> '>='(c,'+'(a,'==>'(a,b))) ),
file('/export/starexec/sandbox2/tmp/tmp.DuXq6pzalO/E---3.1_19262.p',goals_13) ).
fof(sos_07,axiom,
! [X9,X10,X11] :
( '>='('+'(X9,X10),X11)
<=> '>='(X10,'==>'(X9,X11)) ),
file('/export/starexec/sandbox2/tmp/tmp.DuXq6pzalO/E---3.1_19262.p',sos_07) ).
fof(sos_04,axiom,
! [X1] : '>='(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.DuXq6pzalO/E---3.1_19262.p',sos_04) ).
fof(sos_06,axiom,
! [X7,X8] :
( ( '>='(X7,X8)
& '>='(X8,X7) )
=> X7 = X8 ),
file('/export/starexec/sandbox2/tmp/tmp.DuXq6pzalO/E---3.1_19262.p',sos_06) ).
fof(sos_10,axiom,
! [X15,X16,X17] :
( '>='(X15,X16)
=> '>='('==>'(X16,X17),'==>'(X15,X17)) ),
file('/export/starexec/sandbox2/tmp/tmp.DuXq6pzalO/E---3.1_19262.p',sos_10) ).
fof(sos_12,axiom,
! [X1,X2] : '+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.DuXq6pzalO/E---3.1_19262.p',sos_12) ).
fof(sos_11,axiom,
! [X18,X19,X20] :
( '>='(X18,X19)
=> '>='('==>'(X20,X18),'==>'(X20,X19)) ),
file('/export/starexec/sandbox2/tmp/tmp.DuXq6pzalO/E---3.1_19262.p',sos_11) ).
fof(c_0_12,plain,
! [X45] : '+'(X45,'0') = X45,
inference(variable_rename,[status(thm)],[sos_03]) ).
fof(c_0_13,plain,
! [X43,X44] : '+'(X43,X44) = '+'(X44,X43),
inference(variable_rename,[status(thm)],[sos_02]) ).
fof(c_0_14,plain,
! [X31,X32,X33] :
( ~ '>='(X31,X32)
| '>='('+'(X31,X33),'+'(X32,X33)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_09])]) ).
cnf(c_0_15,plain,
'+'(X1,'0') = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
'+'(X1,X2) = '+'(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X30] : '>='(X30,'0'),
inference(variable_rename,[status(thm)],[sos_08]) ).
fof(c_0_18,plain,
! [X22,X23,X24] :
( ~ '>='(X22,X23)
| ~ '>='(X23,X24)
| '>='(X22,X24) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_05])]) ).
cnf(c_0_19,plain,
( '>='('+'(X1,X3),'+'(X2,X3))
| ~ '>='(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
'+'('0',X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
'>='(X1,'0'),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( '>='(X1,X3)
| ~ '>='(X1,X2)
| ~ '>='(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
'>='('+'(X1,X2),X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
fof(c_0_24,negated_conjecture,
~ ( ( '>='(c,a)
& '>='(c,b) )
<=> '>='(c,'+'(a,'==>'(a,b))) ),
inference(assume_negation,[status(cth)],[goals_13]) ).
cnf(c_0_25,plain,
( '>='(X1,X2)
| ~ '>='(X1,'+'(X3,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_26,negated_conjecture,
( ( ~ '>='(c,a)
| ~ '>='(c,b)
| ~ '>='(c,'+'(a,'==>'(a,b))) )
& ( '>='(c,a)
| '>='(c,'+'(a,'==>'(a,b))) )
& ( '>='(c,b)
| '>='(c,'+'(a,'==>'(a,b))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])]) ).
fof(c_0_27,plain,
! [X27,X28,X29] :
( ( ~ '>='('+'(X27,X28),X29)
| '>='(X28,'==>'(X27,X29)) )
& ( ~ '>='(X28,'==>'(X27,X29))
| '>='('+'(X27,X28),X29) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])]) ).
fof(c_0_28,plain,
! [X21] : '>='(X21,X21),
inference(variable_rename,[status(thm)],[sos_04]) ).
cnf(c_0_29,plain,
( '>='(X1,X2)
| ~ '>='(X1,'+'(X2,X3)) ),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_30,negated_conjecture,
( '>='(c,a)
| '>='(c,'+'(a,'==>'(a,b))) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_31,plain,
! [X25,X26] :
( ~ '>='(X25,X26)
| ~ '>='(X26,X25)
| X25 = X26 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_06])]) ).
cnf(c_0_32,plain,
( '>='('+'(X2,X1),X3)
| ~ '>='(X1,'==>'(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,plain,
'>='(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,negated_conjecture,
'>='(c,a),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( X1 = X2
| ~ '>='(X1,X2)
| ~ '>='(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,plain,
( '>='(X2,'==>'(X1,X3))
| ~ '>='('+'(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
'>='('+'(X1,'==>'(X1,X2)),X2),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( '>='(X1,a)
| ~ '>='(X1,c) ),
inference(spm,[status(thm)],[c_0_22,c_0_34]) ).
cnf(c_0_39,plain,
'>='('+'(X1,X2),X1),
inference(spm,[status(thm)],[c_0_23,c_0_16]) ).
fof(c_0_40,plain,
! [X34,X35,X36] :
( ~ '>='(X34,X35)
| '>='('==>'(X35,X36),'==>'(X34,X36)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_10])]) ).
cnf(c_0_41,plain,
( '==>'(X1,X2) = X3
| ~ '>='('==>'(X1,X2),X3)
| ~ '>='('+'(X1,X3),X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
'>='('==>'('0',X1),X1),
inference(spm,[status(thm)],[c_0_37,c_0_20]) ).
cnf(c_0_43,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X2,X4),X3)
| ~ '>='(X1,X4) ),
inference(spm,[status(thm)],[c_0_22,c_0_36]) ).
cnf(c_0_44,negated_conjecture,
'>='('+'(c,X1),a),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
( '>='('==>'(X2,X3),'==>'(X1,X3))
| ~ '>='(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,plain,
'==>'('0',X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_20]),c_0_33])]) ).
cnf(c_0_47,negated_conjecture,
( '>='(X1,'==>'(c,a))
| ~ '>='(X1,X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
'>='(X1,'==>'(X2,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_21])]) ).
fof(c_0_49,plain,
! [X46,X47] : '+'(X46,'==>'(X46,X47)) = '+'(X47,'==>'(X47,X46)),
inference(variable_rename,[status(thm)],[sos_12]) ).
cnf(c_0_50,plain,
( '0' = X1
| ~ '>='('0',X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_21]) ).
cnf(c_0_51,negated_conjecture,
'>='(X1,'==>'(c,a)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
'+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_53,negated_conjecture,
'==>'(c,a) = '0',
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
( ~ '>='(c,a)
| ~ '>='(c,b)
| ~ '>='(c,'+'(a,'==>'(a,b))) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_55,plain,
( '>='(X1,X2)
| ~ '>='(X1,'+'(X3,'==>'(X3,X2))) ),
inference(spm,[status(thm)],[c_0_29,c_0_52]) ).
cnf(c_0_56,negated_conjecture,
( '>='(c,b)
| '>='(c,'+'(a,'==>'(a,b))) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_57,plain,
( '>='('+'(X1,X2),'+'(X3,X1))
| ~ '>='(X2,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_58,negated_conjecture,
'+'(a,'==>'(a,c)) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_15]) ).
fof(c_0_59,plain,
! [X37,X38,X39] :
( ~ '>='(X37,X38)
| '>='('==>'(X39,X37),'==>'(X39,X38)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_11])]) ).
cnf(c_0_60,negated_conjecture,
( ~ '>='(c,'+'(a,'==>'(a,b)))
| ~ '>='(c,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_34])]) ).
cnf(c_0_61,negated_conjecture,
'>='(c,b),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,negated_conjecture,
( '>='(c,'+'(X1,a))
| ~ '>='('==>'(a,c),X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,plain,
( '>='('==>'(X3,X1),'==>'(X3,X2))
| ~ '>='(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_64,negated_conjecture,
~ '>='(c,'+'(a,'==>'(a,b))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]) ).
cnf(c_0_65,negated_conjecture,
( '>='(c,'+'(a,'==>'(a,X1)))
| ~ '>='(c,X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_16]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL894+1 : TPTP v8.1.2. Released v5.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n002.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.21/0.35 % CPULimit : 2400
% 0.21/0.35 % WCLimit : 300
% 0.21/0.35 % DateTime : Mon Oct 2 13:05:44 EDT 2023
% 0.21/0.35 % CPUTime :
% 0.21/0.47 Running first-order model finding
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.DuXq6pzalO/E---3.1_19262.p
% 0.21/0.60 # Version: 3.1pre001
% 0.21/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.60 # Starting sh5l with 300s (1) cores
% 0.21/0.60 # sh5l with pid 19391 completed with status 0
% 0.21/0.60 # Result found by sh5l
% 0.21/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.60 # Starting sh5l with 300s (1) cores
% 0.21/0.60 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.60 # Search class: FGHSM-FFSF22-SFFFFFNN
% 0.21/0.60 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.60 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.60 # SAT001_MinMin_p005000_rr_RG with pid 19397 completed with status 0
% 0.21/0.60 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.60 # Starting sh5l with 300s (1) cores
% 0.21/0.60 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.60 # Search class: FGHSM-FFSF22-SFFFFFNN
% 0.21/0.60 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.60 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.60 # Preprocessing time : 0.001 s
% 0.21/0.60 # Presaturation interreduction done
% 0.21/0.60
% 0.21/0.60 # Proof found!
% 0.21/0.60 # SZS status Theorem
% 0.21/0.60 # SZS output start CNFRefutation
% See solution above
% 0.21/0.60 # Parsed axioms : 13
% 0.21/0.60 # Removed by relevancy pruning/SinE : 0
% 0.21/0.60 # Initial clauses : 16
% 0.21/0.60 # Removed in clause preprocessing : 0
% 0.21/0.60 # Initial clauses in saturation : 16
% 0.21/0.60 # Processed clauses : 1806
% 0.21/0.60 # ...of these trivial : 87
% 0.21/0.60 # ...subsumed : 1352
% 0.21/0.60 # ...remaining for further processing : 367
% 0.21/0.60 # Other redundant clauses eliminated : 0
% 0.21/0.60 # Clauses deleted for lack of memory : 0
% 0.21/0.60 # Backward-subsumed : 52
% 0.21/0.60 # Backward-rewritten : 49
% 0.21/0.60 # Generated clauses : 8076
% 0.21/0.60 # ...of the previous two non-redundant : 6984
% 0.21/0.60 # ...aggressively subsumed : 0
% 0.21/0.60 # Contextual simplify-reflections : 9
% 0.21/0.60 # Paramodulations : 8076
% 0.21/0.60 # Factorizations : 0
% 0.21/0.60 # NegExts : 0
% 0.21/0.60 # Equation resolutions : 0
% 0.21/0.60 # Total rewrite steps : 3007
% 0.21/0.60 # Propositional unsat checks : 0
% 0.21/0.60 # Propositional check models : 0
% 0.21/0.60 # Propositional check unsatisfiable : 0
% 0.21/0.60 # Propositional clauses : 0
% 0.21/0.60 # Propositional clauses after purity: 0
% 0.21/0.60 # Propositional unsat core size : 0
% 0.21/0.60 # Propositional preprocessing time : 0.000
% 0.21/0.60 # Propositional encoding time : 0.000
% 0.21/0.60 # Propositional solver time : 0.000
% 0.21/0.60 # Success case prop preproc time : 0.000
% 0.21/0.60 # Success case prop encoding time : 0.000
% 0.21/0.60 # Success case prop solver time : 0.000
% 0.21/0.60 # Current number of processed clauses : 250
% 0.21/0.60 # Positive orientable unit clauses : 49
% 0.21/0.60 # Positive unorientable unit clauses: 9
% 0.21/0.60 # Negative unit clauses : 30
% 0.21/0.60 # Non-unit-clauses : 162
% 0.21/0.60 # Current number of unprocessed clauses: 5035
% 0.21/0.60 # ...number of literals in the above : 10530
% 0.21/0.60 # Current number of archived formulas : 0
% 0.21/0.60 # Current number of archived clauses : 117
% 0.21/0.60 # Clause-clause subsumption calls (NU) : 7366
% 0.21/0.60 # Rec. Clause-clause subsumption calls : 6752
% 0.21/0.60 # Non-unit clause-clause subsumptions : 591
% 0.21/0.60 # Unit Clause-clause subsumption calls : 406
% 0.21/0.60 # Rewrite failures with RHS unbound : 0
% 0.21/0.60 # BW rewrite match attempts : 198
% 0.21/0.60 # BW rewrite match successes : 71
% 0.21/0.60 # Condensation attempts : 0
% 0.21/0.60 # Condensation successes : 0
% 0.21/0.60 # Termbank termtop insertions : 77061
% 0.21/0.60
% 0.21/0.60 # -------------------------------------------------
% 0.21/0.60 # User time : 0.105 s
% 0.21/0.60 # System time : 0.005 s
% 0.21/0.60 # Total time : 0.110 s
% 0.21/0.60 # Maximum resident set size: 1736 pages
% 0.21/0.60
% 0.21/0.60 # -------------------------------------------------
% 0.21/0.60 # User time : 0.107 s
% 0.21/0.60 # System time : 0.007 s
% 0.21/0.60 # Total time : 0.113 s
% 0.21/0.60 # Maximum resident set size: 1704 pages
% 0.21/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------