TSTP Solution File: KLE022+4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE022+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:04:41 EDT 2023
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 14 unt; 0 def)
% Number of atoms : 71 ( 34 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 68 ( 29 ~; 23 |; 10 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn; 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] :
( test(X5)
=> ( leq(X4,addition(multiplication(X4,X5),multiplication(X4,c(X5))))
& leq(addition(multiplication(X4,X5),multiplication(X4,c(X5))),X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.Q3RcJlBLAE/E---3.1_12972.p',goals) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.Q3RcJlBLAE/E---3.1_12972.p',right_distributivity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.Q3RcJlBLAE/E---3.1_12972.p',order) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.Q3RcJlBLAE/E---3.1_12972.p',additive_commutativity) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox/tmp/tmp.Q3RcJlBLAE/E---3.1_12972.p',test_3) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox/tmp/tmp.Q3RcJlBLAE/E---3.1_12972.p',test_2) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.Q3RcJlBLAE/E---3.1_12972.p',multiplicative_right_identity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.Q3RcJlBLAE/E---3.1_12972.p',additive_idempotence) ).
fof(c_0_8,negated_conjecture,
~ ! [X4,X5] :
( test(X5)
=> ( leq(X4,addition(multiplication(X4,X5),multiplication(X4,c(X5))))
& leq(addition(multiplication(X4,X5),multiplication(X4,c(X5))),X4) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_9,negated_conjecture,
( test(esk3_0)
& ( ~ leq(esk2_0,addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0))))
| ~ leq(addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0))),esk2_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_10,plain,
! [X18,X19,X20] : multiplication(X18,addition(X19,X20)) = addition(multiplication(X18,X19),multiplication(X18,X20)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_11,negated_conjecture,
( ~ leq(esk2_0,addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0))))
| ~ leq(addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0))),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X26,X27] :
( ( ~ leq(X26,X27)
| addition(X26,X27) = X27 )
& ( addition(X26,X27) != X27
| leq(X26,X27) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
fof(c_0_14,plain,
! [X6,X7] : addition(X6,X7) = addition(X7,X6),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_15,plain,
! [X34,X35] :
( ( c(X34) != X35
| complement(X34,X35)
| ~ test(X34) )
& ( ~ complement(X34,X35)
| c(X34) = X35
| ~ test(X34) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
cnf(c_0_16,negated_conjecture,
( ~ leq(esk2_0,multiplication(esk2_0,addition(esk3_0,c(esk3_0))))
| ~ leq(multiplication(esk2_0,addition(esk3_0,c(esk3_0))),esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).
cnf(c_0_17,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X32,X33] :
( ( multiplication(X32,X33) = zero
| ~ complement(X33,X32) )
& ( multiplication(X33,X32) = zero
| ~ complement(X33,X32) )
& ( addition(X32,X33) = one
| ~ complement(X33,X32) )
& ( multiplication(X32,X33) != zero
| multiplication(X33,X32) != zero
| addition(X32,X33) != one
| complement(X33,X32) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
cnf(c_0_20,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( addition(esk2_0,multiplication(esk2_0,addition(esk3_0,c(esk3_0)))) != esk2_0
| ~ leq(esk2_0,multiplication(esk2_0,addition(esk3_0,c(esk3_0)))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_22,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_20]) ).
fof(c_0_24,plain,
! [X16] : multiplication(X16,one) = X16,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_25,plain,
! [X12] : addition(X12,X12) = X12,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_26,negated_conjecture,
( addition(esk2_0,multiplication(esk2_0,addition(esk3_0,c(esk3_0)))) != multiplication(esk2_0,addition(esk3_0,c(esk3_0)))
| addition(esk2_0,multiplication(esk2_0,addition(esk3_0,c(esk3_0)))) != esk2_0 ),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_27,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_18]) ).
cnf(c_0_28,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]),c_0_28]),c_0_28]),c_0_29]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE022+4 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 04:52:28 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.Q3RcJlBLAE/E---3.1_12972.p
% 0.19/0.50 # Version: 3.1pre001
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 13112 completed with status 0
% 0.19/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FGHSM-FFMF21-MFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 811s (1) cores
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.50 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S00EN with 136s (1) cores
% 0.19/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 13122 completed with status 0
% 0.19/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FGHSM-FFMF21-MFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 811s (1) cores
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 19
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 26
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 26
% 0.19/0.50 # Processed clauses : 66
% 0.19/0.50 # ...of these trivial : 1
% 0.19/0.50 # ...subsumed : 1
% 0.19/0.50 # ...remaining for further processing : 64
% 0.19/0.50 # Other redundant clauses eliminated : 1
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 0
% 0.19/0.50 # Backward-rewritten : 1
% 0.19/0.50 # Generated clauses : 109
% 0.19/0.50 # ...of the previous two non-redundant : 59
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 1
% 0.19/0.50 # Paramodulations : 108
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 1
% 0.19/0.50 # Total rewrite steps : 104
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 36
% 0.19/0.50 # Positive orientable unit clauses : 13
% 0.19/0.50 # Positive unorientable unit clauses: 1
% 0.19/0.50 # Negative unit clauses : 0
% 0.19/0.50 # Non-unit-clauses : 22
% 0.19/0.50 # Current number of unprocessed clauses: 43
% 0.19/0.50 # ...number of literals in the above : 85
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 27
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 66
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 58
% 0.19/0.50 # Non-unit clause-clause subsumptions : 2
% 0.19/0.50 # Unit Clause-clause subsumption calls : 2
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 19
% 0.19/0.50 # BW rewrite match successes : 15
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 2271
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.007 s
% 0.19/0.50 # System time : 0.003 s
% 0.19/0.50 # Total time : 0.010 s
% 0.19/0.50 # Maximum resident set size: 1772 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.029 s
% 0.19/0.50 # System time : 0.011 s
% 0.19/0.50 # Total time : 0.041 s
% 0.19/0.50 # Maximum resident set size: 1692 pages
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------