TSTP Solution File: KLE025+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE025+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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.15s 0.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 23 unt; 0 def)
% Number of atoms : 67 ( 42 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 52 ( 19 ~; 15 |; 11 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 1 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 : 52 ( 0 sgn; 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] :
( ( test(X5)
& test(X6) )
=> ( multiplication(multiplication(X5,X4),c(X6)) = zero
=> multiplication(X5,X4) = multiplication(multiplication(X5,X4),X6) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ihtPh7o5jz/E---3.1_14831.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.ihtPh7o5jz/E---3.1_14831.p',multiplicative_associativity) ).
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.ihtPh7o5jz/E---3.1_14831.p',right_distributivity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ihtPh7o5jz/E---3.1_14831.p',additive_identity) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ihtPh7o5jz/E---3.1_14831.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.ihtPh7o5jz/E---3.1_14831.p',test_2) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.ihtPh7o5jz/E---3.1_14831.p',additive_commutativity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ihtPh7o5jz/E---3.1_14831.p',multiplicative_right_identity) ).
fof(c_0_8,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X5)
& test(X6) )
=> ( multiplication(multiplication(X5,X4),c(X6)) = zero
=> multiplication(X5,X4) = multiplication(multiplication(X5,X4),X6) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_9,negated_conjecture,
( test(esk3_0)
& test(esk4_0)
& multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)) = zero
& multiplication(esk3_0,esk2_0) != multiplication(multiplication(esk3_0,esk2_0),esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_10,plain,
! [X14,X15,X16] : multiplication(X14,multiplication(X15,X16)) = multiplication(multiplication(X14,X15),X16),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_11,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_12,negated_conjecture,
multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)) = zero,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X12] : addition(X12,zero) = X12,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_15,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])])]) ).
cnf(c_0_16,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,c(esk4_0))) = zero,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,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_20,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X7,X8] : addition(X7,X8) = addition(X8,X7),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_22,negated_conjecture,
multiplication(esk3_0,addition(X1,multiplication(esk2_0,c(esk4_0)))) = multiplication(esk3_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_23,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_26,plain,
! [X17] : multiplication(X17,one) = X17,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_27,negated_conjecture,
multiplication(esk3_0,esk2_0) != multiplication(multiplication(esk3_0,esk2_0),esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,addition(X1,c(esk4_0)))) = multiplication(esk3_0,multiplication(esk2_0,X1)),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_29,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_30,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
test(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,esk4_0)) != multiplication(esk3_0,esk2_0),
inference(rw,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_33,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_28,c_0_29]),c_0_30]),c_0_31])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : KLE025+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n024.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Oct 3 04:50:57 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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.ihtPh7o5jz/E---3.1_14831.p
% 0.15/0.47 # Version: 3.1pre001
% 0.15/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 # Starting sh5l with 300s (1) cores
% 0.15/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 14911 completed with status 0
% 0.15/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.47 # No SInE strategy applied
% 0.15/0.47 # Search class: FGUSM-FFSS21-SFFFFFNN
% 0.15/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.47 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.47 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.47 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.47 # Starting sh5l with 136s (1) cores
% 0.15/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 14916 completed with status 0
% 0.15/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.47 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.47 # No SInE strategy applied
% 0.15/0.47 # Search class: FGUSM-FFSS21-SFFFFFNN
% 0.15/0.47 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.47 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.15/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.47 # Preprocessing time : 0.001 s
% 0.15/0.47 # Presaturation interreduction done
% 0.15/0.47
% 0.15/0.47 # Proof found!
% 0.15/0.47 # SZS status Theorem
% 0.15/0.47 # SZS output start CNFRefutation
% See solution above
% 0.15/0.47 # Parsed axioms : 17
% 0.15/0.47 # Removed by relevancy pruning/SinE : 0
% 0.15/0.47 # Initial clauses : 26
% 0.15/0.47 # Removed in clause preprocessing : 0
% 0.15/0.47 # Initial clauses in saturation : 26
% 0.15/0.47 # Processed clauses : 545
% 0.15/0.47 # ...of these trivial : 29
% 0.15/0.47 # ...subsumed : 262
% 0.15/0.47 # ...remaining for further processing : 254
% 0.15/0.47 # Other redundant clauses eliminated : 34
% 0.15/0.47 # Clauses deleted for lack of memory : 0
% 0.15/0.47 # Backward-subsumed : 31
% 0.15/0.47 # Backward-rewritten : 24
% 0.15/0.47 # Generated clauses : 4450
% 0.15/0.47 # ...of the previous two non-redundant : 2984
% 0.15/0.47 # ...aggressively subsumed : 0
% 0.15/0.47 # Contextual simplify-reflections : 20
% 0.15/0.47 # Paramodulations : 4416
% 0.15/0.47 # Factorizations : 0
% 0.15/0.47 # NegExts : 0
% 0.15/0.47 # Equation resolutions : 34
% 0.15/0.47 # Total rewrite steps : 5728
% 0.15/0.47 # Propositional unsat checks : 0
% 0.15/0.47 # Propositional check models : 0
% 0.15/0.47 # Propositional check unsatisfiable : 0
% 0.15/0.47 # Propositional clauses : 0
% 0.15/0.47 # Propositional clauses after purity: 0
% 0.15/0.47 # Propositional unsat core size : 0
% 0.15/0.47 # Propositional preprocessing time : 0.000
% 0.15/0.47 # Propositional encoding time : 0.000
% 0.15/0.47 # Propositional solver time : 0.000
% 0.15/0.47 # Success case prop preproc time : 0.000
% 0.15/0.47 # Success case prop encoding time : 0.000
% 0.15/0.47 # Success case prop solver time : 0.000
% 0.15/0.47 # Current number of processed clauses : 172
% 0.15/0.47 # Positive orientable unit clauses : 66
% 0.15/0.47 # Positive unorientable unit clauses: 3
% 0.15/0.47 # Negative unit clauses : 4
% 0.15/0.47 # Non-unit-clauses : 99
% 0.15/0.47 # Current number of unprocessed clauses: 2408
% 0.15/0.47 # ...number of literals in the above : 4644
% 0.15/0.47 # Current number of archived formulas : 0
% 0.15/0.47 # Current number of archived clauses : 81
% 0.15/0.47 # Clause-clause subsumption calls (NU) : 3122
% 0.15/0.47 # Rec. Clause-clause subsumption calls : 2785
% 0.15/0.47 # Non-unit clause-clause subsumptions : 259
% 0.15/0.47 # Unit Clause-clause subsumption calls : 269
% 0.15/0.47 # Rewrite failures with RHS unbound : 0
% 0.15/0.47 # BW rewrite match attempts : 65
% 0.15/0.47 # BW rewrite match successes : 37
% 0.15/0.47 # Condensation attempts : 0
% 0.15/0.47 # Condensation successes : 0
% 0.15/0.47 # Termbank termtop insertions : 57778
% 0.15/0.47
% 0.15/0.47 # -------------------------------------------------
% 0.15/0.47 # User time : 0.050 s
% 0.15/0.47 # System time : 0.006 s
% 0.15/0.47 # Total time : 0.056 s
% 0.15/0.47 # Maximum resident set size: 1756 pages
% 0.15/0.47
% 0.15/0.47 # -------------------------------------------------
% 0.15/0.47 # User time : 0.257 s
% 0.15/0.47 # System time : 0.015 s
% 0.15/0.47 # Total time : 0.272 s
% 0.15/0.47 # Maximum resident set size: 1688 pages
% 0.15/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------