TSTP Solution File: KLE024+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE024+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:42 EDT 2023
% Result : Theorem 0.37s 0.94s
% Output : CNFRefutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 46 ( 28 unt; 0 def)
% Number of atoms : 86 ( 54 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 66 ( 26 ~; 22 |; 11 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 68 ( 4 sgn; 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OqopmP0q2N/E---3.1_29679.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/sandbox2/tmp/tmp.OqopmP0q2N/E---3.1_29679.p',test_2) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.OqopmP0q2N/E---3.1_29679.p',right_distributivity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.OqopmP0q2N/E---3.1_29679.p',additive_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.OqopmP0q2N/E---3.1_29679.p',additive_commutativity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.OqopmP0q2N/E---3.1_29679.p',multiplicative_right_identity) ).
fof(goals,conjecture,
! [X4,X5,X6] :
( ( test(X5)
& test(X6) )
=> ( addition(multiplication(X4,c(X6)),multiplication(c(X5),X4)) = multiplication(c(X5),X4)
=> multiplication(multiplication(X5,X4),c(X6)) = zero ) ),
file('/export/starexec/sandbox2/tmp/tmp.OqopmP0q2N/E---3.1_29679.p',goals) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.OqopmP0q2N/E---3.1_29679.p',multiplicative_associativity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/tmp.OqopmP0q2N/E---3.1_29679.p',left_annihilation) ).
fof(c_0_9,plain,
! [X35,X36] :
( ( c(X35) != X36
| complement(X35,X36)
| ~ test(X35) )
& ( ~ complement(X35,X36)
| c(X35) = X36
| ~ test(X35) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
fof(c_0_10,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])])]) ).
cnf(c_0_11,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X19,X20,X21] : multiplication(X19,addition(X20,X21)) = addition(multiplication(X19,X20),multiplication(X19,X21)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_13,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X12] : addition(X12,zero) = X12,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_16,plain,
! [X7,X8] : addition(X7,X8) = addition(X8,X7),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_17,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( multiplication(X1,c(X1)) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X17] : multiplication(X17,one) = X17,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_23,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X5)
& test(X6) )
=> ( addition(multiplication(X4,c(X6)),multiplication(c(X5),X4)) = multiplication(c(X5),X4)
=> multiplication(multiplication(X5,X4),c(X6)) = zero ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_24,plain,
! [X14,X15,X16] : multiplication(X14,multiplication(X15,X16)) = multiplication(multiplication(X14,X15),X16),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_25,plain,
( multiplication(X1,addition(X2,c(X1))) = multiplication(X1,X2)
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_26,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_14]),c_0_21]) ).
cnf(c_0_27,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_28,negated_conjecture,
( test(esk3_0)
& test(esk4_0)
& addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0)) = multiplication(c(esk3_0),esk2_0)
& multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)) != zero ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
cnf(c_0_29,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( multiplication(X1,X1) = X1
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_31,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_32,plain,
! [X26] : multiplication(zero,X26) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_33,plain,
( multiplication(X1,multiplication(X2,c(multiplication(X1,X2)))) = zero
| ~ test(multiplication(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
multiplication(esk3_0,esk3_0) = esk3_0,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_36,negated_conjecture,
multiplication(esk3_0,multiplication(esk3_0,c(esk3_0))) = zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_31])]) ).
cnf(c_0_37,negated_conjecture,
multiplication(esk3_0,multiplication(esk3_0,X1)) = multiplication(esk3_0,X1),
inference(spm,[status(thm)],[c_0_29,c_0_34]) ).
cnf(c_0_38,plain,
( multiplication(X1,multiplication(c(X1),X2)) = zero
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_18]),c_0_35]) ).
cnf(c_0_39,negated_conjecture,
multiplication(esk3_0,c(esk3_0)) = zero,
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)) != zero,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_41,plain,
( multiplication(X1,addition(X2,multiplication(c(X1),X3))) = multiplication(X1,X2)
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_38]),c_0_19]) ).
cnf(c_0_42,negated_conjecture,
addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0)) = multiplication(c(esk3_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_43,negated_conjecture,
multiplication(esk3_0,multiplication(c(esk3_0),X1)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_39]),c_0_35]) ).
cnf(c_0_44,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,c(esk4_0))) != zero,
inference(rw,[status(thm)],[c_0_40,c_0_29]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_31])]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : KLE024+2 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n029.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 2400
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Oct 3 05:07:52 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.37/0.52 Running first-order model finding
% 0.37/0.52 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.OqopmP0q2N/E---3.1_29679.p
% 0.37/0.94 # Version: 3.1pre001
% 0.37/0.94 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/0.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.94 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/0.94 # Starting new_bool_3 with 300s (1) cores
% 0.37/0.94 # Starting new_bool_1 with 300s (1) cores
% 0.37/0.94 # Starting sh5l with 300s (1) cores
% 0.37/0.94 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 29756 completed with status 0
% 0.37/0.94 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.37/0.94 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/0.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.94 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/0.94 # No SInE strategy applied
% 0.37/0.94 # Search class: FGUSM-FFMS21-MFFFFFNN
% 0.37/0.94 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.94 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 811s (1) cores
% 0.37/0.94 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.37/0.94 # Starting new_bool_3 with 136s (1) cores
% 0.37/0.94 # Starting new_bool_1 with 136s (1) cores
% 0.37/0.94 # Starting sh5l with 136s (1) cores
% 0.37/0.94 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 29763 completed with status 0
% 0.37/0.94 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.37/0.94 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.37/0.94 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.37/0.94 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.37/0.94 # No SInE strategy applied
% 0.37/0.94 # Search class: FGUSM-FFMS21-MFFFFFNN
% 0.37/0.94 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.37/0.94 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 811s (1) cores
% 0.37/0.94 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.37/0.94 # Preprocessing time : 0.001 s
% 0.37/0.94 # Presaturation interreduction done
% 0.37/0.94
% 0.37/0.94 # Proof found!
% 0.37/0.94 # SZS status Theorem
% 0.37/0.94 # SZS output start CNFRefutation
% See solution above
% 0.37/0.94 # Parsed axioms : 19
% 0.37/0.94 # Removed by relevancy pruning/SinE : 0
% 0.37/0.94 # Initial clauses : 28
% 0.37/0.94 # Removed in clause preprocessing : 0
% 0.37/0.94 # Initial clauses in saturation : 28
% 0.37/0.94 # Processed clauses : 3504
% 0.37/0.94 # ...of these trivial : 282
% 0.37/0.94 # ...subsumed : 2426
% 0.37/0.94 # ...remaining for further processing : 796
% 0.37/0.94 # Other redundant clauses eliminated : 250
% 0.37/0.94 # Clauses deleted for lack of memory : 0
% 0.37/0.94 # Backward-subsumed : 126
% 0.37/0.94 # Backward-rewritten : 231
% 0.37/0.94 # Generated clauses : 33955
% 0.37/0.94 # ...of the previous two non-redundant : 23917
% 0.37/0.94 # ...aggressively subsumed : 0
% 0.37/0.94 # Contextual simplify-reflections : 102
% 0.37/0.94 # Paramodulations : 33701
% 0.37/0.94 # Factorizations : 3
% 0.37/0.94 # NegExts : 0
% 0.37/0.94 # Equation resolutions : 250
% 0.37/0.94 # Total rewrite steps : 47322
% 0.37/0.94 # Propositional unsat checks : 0
% 0.37/0.94 # Propositional check models : 0
% 0.37/0.94 # Propositional check unsatisfiable : 0
% 0.37/0.94 # Propositional clauses : 0
% 0.37/0.94 # Propositional clauses after purity: 0
% 0.37/0.94 # Propositional unsat core size : 0
% 0.37/0.94 # Propositional preprocessing time : 0.000
% 0.37/0.94 # Propositional encoding time : 0.000
% 0.37/0.94 # Propositional solver time : 0.000
% 0.37/0.94 # Success case prop preproc time : 0.000
% 0.37/0.94 # Success case prop encoding time : 0.000
% 0.37/0.94 # Success case prop solver time : 0.000
% 0.37/0.94 # Current number of processed clauses : 409
% 0.37/0.94 # Positive orientable unit clauses : 110
% 0.37/0.94 # Positive unorientable unit clauses: 8
% 0.37/0.94 # Negative unit clauses : 6
% 0.37/0.94 # Non-unit-clauses : 285
% 0.37/0.94 # Current number of unprocessed clauses: 19875
% 0.37/0.94 # ...number of literals in the above : 57386
% 0.37/0.94 # Current number of archived formulas : 0
% 0.37/0.94 # Current number of archived clauses : 386
% 0.37/0.94 # Clause-clause subsumption calls (NU) : 39673
% 0.37/0.94 # Rec. Clause-clause subsumption calls : 34564
% 0.37/0.94 # Non-unit clause-clause subsumptions : 2241
% 0.37/0.94 # Unit Clause-clause subsumption calls : 1652
% 0.37/0.94 # Rewrite failures with RHS unbound : 0
% 0.37/0.94 # BW rewrite match attempts : 227
% 0.37/0.94 # BW rewrite match successes : 157
% 0.37/0.94 # Condensation attempts : 0
% 0.37/0.94 # Condensation successes : 0
% 0.37/0.94 # Termbank termtop insertions : 507633
% 0.37/0.94
% 0.37/0.94 # -------------------------------------------------
% 0.37/0.94 # User time : 0.362 s
% 0.37/0.94 # System time : 0.017 s
% 0.37/0.94 # Total time : 0.379 s
% 0.37/0.94 # Maximum resident set size: 1760 pages
% 0.37/0.94
% 0.37/0.94 # -------------------------------------------------
% 0.37/0.94 # User time : 1.681 s
% 0.37/0.94 # System time : 0.033 s
% 0.37/0.94 # Total time : 1.714 s
% 0.37/0.94 # Maximum resident set size: 1692 pages
% 0.37/0.94 % E---3.1 exiting
%------------------------------------------------------------------------------