TSTP Solution File: KLE026+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE026+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:03:55 EDT 2023
% Result : Theorem 0.17s 0.49s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 41 ( 27 unt; 0 def)
% Number of atoms : 75 ( 43 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 53 ( 19 ~; 15 |; 12 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn; 44 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] :
( ( test(X5)
& test(X6) )
=> ( multiplication(X5,X4) = multiplication(multiplication(X5,X4),X6)
=> leq(multiplication(X5,X4),multiplication(X4,X6)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4MMrJK9Fk7/E---3.1_29999.p',goals) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.4MMrJK9Fk7/E---3.1_29999.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.4MMrJK9Fk7/E---3.1_29999.p',additive_idempotence) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox2/tmp/tmp.4MMrJK9Fk7/E---3.1_29999.p',test_2) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.4MMrJK9Fk7/E---3.1_29999.p',test_1) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.4MMrJK9Fk7/E---3.1_29999.p',multiplicative_associativity) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.4MMrJK9Fk7/E---3.1_29999.p',left_distributivity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.4MMrJK9Fk7/E---3.1_29999.p',additive_commutativity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.4MMrJK9Fk7/E---3.1_29999.p',order) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.4MMrJK9Fk7/E---3.1_29999.p',multiplicative_left_identity) ).
fof(c_0_10,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X5)
& test(X6) )
=> ( multiplication(X5,X4) = multiplication(multiplication(X5,X4),X6)
=> leq(multiplication(X5,X4),multiplication(X4,X6)) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_11,plain,
! [X9,X10,X11] : addition(X11,addition(X10,X9)) = addition(addition(X11,X10),X9),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_12,plain,
! [X13] : addition(X13,X13) = X13,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_13,plain,
! [X33,X34] :
( ( multiplication(X33,X34) = zero
| ~ complement(X34,X33) )
& ( multiplication(X34,X33) = zero
| ~ complement(X34,X33) )
& ( addition(X33,X34) = one
| ~ complement(X34,X33) )
& ( multiplication(X33,X34) != zero
| multiplication(X34,X33) != zero
| addition(X33,X34) != one
| complement(X34,X33) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
fof(c_0_14,plain,
! [X29,X31,X32] :
( ( ~ test(X29)
| complement(esk1_1(X29),X29) )
& ( ~ complement(X32,X31)
| test(X31) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[test_1])])])])]) ).
fof(c_0_15,negated_conjecture,
( test(esk3_0)
& test(esk4_0)
& multiplication(esk3_0,esk2_0) = multiplication(multiplication(esk3_0,esk2_0),esk4_0)
& ~ leq(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_16,plain,
! [X14,X15,X16] : multiplication(X14,multiplication(X15,X16)) = multiplication(multiplication(X14,X15),X16),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_17,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( complement(esk1_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_21,plain,
! [X22,X23,X24] : multiplication(addition(X22,X23),X24) = addition(multiplication(X22,X24),multiplication(X23,X24)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_22,negated_conjecture,
multiplication(esk3_0,esk2_0) = multiplication(multiplication(esk3_0,esk2_0),esk4_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_24,plain,
! [X7,X8] : addition(X7,X8) = addition(X8,X7),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_25,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,plain,
( addition(X1,esk1_1(X1)) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_27,plain,
! [X27,X28] :
( ( ~ leq(X27,X28)
| addition(X27,X28) = X28 )
& ( addition(X27,X28) != X28
| leq(X27,X28) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
cnf(c_0_28,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,esk4_0)) = multiplication(esk3_0,esk2_0),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_31,plain,
! [X18] : multiplication(one,X18) = X18,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_32,plain,
( addition(X1,one) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_34,negated_conjecture,
~ leq(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_35,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,negated_conjecture,
addition(multiplication(esk3_0,esk2_0),multiplication(X1,multiplication(esk2_0,esk4_0))) = multiplication(addition(X1,esk3_0),multiplication(esk2_0,esk4_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_37,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
addition(one,esk3_0) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_30]) ).
cnf(c_0_39,negated_conjecture,
addition(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0)) != multiplication(esk2_0,esk4_0),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_37]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : KLE026+1 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n014.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue Oct 3 04:47:49 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.4MMrJK9Fk7/E---3.1_29999.p
% 0.17/0.49 # Version: 3.1pre001
% 0.17/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.49 # Starting sh5l with 300s (1) cores
% 0.17/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30077 completed with status 0
% 0.17/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.49 # No SInE strategy applied
% 0.17/0.49 # Search class: FGUSM-FFSS21-SFFFFFNN
% 0.17/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.49 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.49 # Starting sh5l with 136s (1) cores
% 0.17/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30082 completed with status 0
% 0.17/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.49 # No SInE strategy applied
% 0.17/0.49 # Search class: FGUSM-FFSS21-SFFFFFNN
% 0.17/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.49 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.17/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.49 # Preprocessing time : 0.001 s
% 0.17/0.49 # Presaturation interreduction done
% 0.17/0.49
% 0.17/0.49 # Proof found!
% 0.17/0.49 # SZS status Theorem
% 0.17/0.49 # SZS output start CNFRefutation
% See solution above
% 0.17/0.49 # Parsed axioms : 17
% 0.17/0.49 # Removed by relevancy pruning/SinE : 0
% 0.17/0.49 # Initial clauses : 26
% 0.17/0.49 # Removed in clause preprocessing : 0
% 0.17/0.49 # Initial clauses in saturation : 26
% 0.17/0.49 # Processed clauses : 380
% 0.17/0.49 # ...of these trivial : 41
% 0.17/0.49 # ...subsumed : 117
% 0.17/0.49 # ...remaining for further processing : 222
% 0.17/0.49 # Other redundant clauses eliminated : 11
% 0.17/0.49 # Clauses deleted for lack of memory : 0
% 0.17/0.49 # Backward-subsumed : 15
% 0.17/0.49 # Backward-rewritten : 26
% 0.17/0.49 # Generated clauses : 2592
% 0.17/0.49 # ...of the previous two non-redundant : 1689
% 0.17/0.49 # ...aggressively subsumed : 0
% 0.17/0.49 # Contextual simplify-reflections : 13
% 0.17/0.49 # Paramodulations : 2581
% 0.17/0.49 # Factorizations : 0
% 0.17/0.49 # NegExts : 0
% 0.17/0.49 # Equation resolutions : 11
% 0.17/0.49 # Total rewrite steps : 3052
% 0.17/0.49 # Propositional unsat checks : 0
% 0.17/0.49 # Propositional check models : 0
% 0.17/0.49 # Propositional check unsatisfiable : 0
% 0.17/0.49 # Propositional clauses : 0
% 0.17/0.49 # Propositional clauses after purity: 0
% 0.17/0.49 # Propositional unsat core size : 0
% 0.17/0.49 # Propositional preprocessing time : 0.000
% 0.17/0.49 # Propositional encoding time : 0.000
% 0.17/0.49 # Propositional solver time : 0.000
% 0.17/0.49 # Success case prop preproc time : 0.000
% 0.17/0.49 # Success case prop encoding time : 0.000
% 0.17/0.49 # Success case prop solver time : 0.000
% 0.17/0.49 # Current number of processed clauses : 154
% 0.17/0.49 # Positive orientable unit clauses : 74
% 0.17/0.49 # Positive unorientable unit clauses: 3
% 0.17/0.49 # Negative unit clauses : 3
% 0.17/0.49 # Non-unit-clauses : 74
% 0.17/0.49 # Current number of unprocessed clauses: 1326
% 0.17/0.49 # ...number of literals in the above : 2122
% 0.17/0.49 # Current number of archived formulas : 0
% 0.17/0.49 # Current number of archived clauses : 67
% 0.17/0.49 # Clause-clause subsumption calls (NU) : 1260
% 0.17/0.49 # Rec. Clause-clause subsumption calls : 1101
% 0.17/0.49 # Non-unit clause-clause subsumptions : 116
% 0.17/0.49 # Unit Clause-clause subsumption calls : 138
% 0.17/0.49 # Rewrite failures with RHS unbound : 0
% 0.17/0.49 # BW rewrite match attempts : 101
% 0.17/0.49 # BW rewrite match successes : 47
% 0.17/0.49 # Condensation attempts : 0
% 0.17/0.49 # Condensation successes : 0
% 0.17/0.49 # Termbank termtop insertions : 31659
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.039 s
% 0.17/0.49 # System time : 0.000 s
% 0.17/0.49 # Total time : 0.039 s
% 0.17/0.49 # Maximum resident set size: 1744 pages
% 0.17/0.49
% 0.17/0.49 # -------------------------------------------------
% 0.17/0.49 # User time : 0.179 s
% 0.17/0.49 # System time : 0.005 s
% 0.17/0.49 # Total time : 0.185 s
% 0.17/0.49 # Maximum resident set size: 1688 pages
% 0.17/0.49 % E---3.1 exiting
% 0.17/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------