TSTP Solution File: KLE025+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE025+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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.16s 0.44s
% Output : CNFRefutation 0.16s
% 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.eUHT2EvJnw/E---3.1_6891.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.eUHT2EvJnw/E---3.1_6891.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.eUHT2EvJnw/E---3.1_6891.p',right_distributivity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.eUHT2EvJnw/E---3.1_6891.p',additive_identity) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.eUHT2EvJnw/E---3.1_6891.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.eUHT2EvJnw/E---3.1_6891.p',test_2) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.eUHT2EvJnw/E---3.1_6891.p',additive_commutativity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.eUHT2EvJnw/E---3.1_6891.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(esk2_0)
& test(esk3_0)
& multiplication(multiplication(esk2_0,esk1_0),c(esk3_0)) = zero
& multiplication(esk2_0,esk1_0) != multiplication(multiplication(esk2_0,esk1_0),esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_10,plain,
! [X10,X11,X12] : multiplication(X10,multiplication(X11,X12)) = multiplication(multiplication(X10,X11),X12),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_11,plain,
! [X15,X16,X17] : multiplication(X15,addition(X16,X17)) = addition(multiplication(X15,X16),multiplication(X15,X17)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_12,negated_conjecture,
multiplication(multiplication(esk2_0,esk1_0),c(esk3_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,
! [X29] : addition(X29,zero) = X29,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_15,plain,
! [X31,X32] :
( ( c(X31) != X32
| complement(X31,X32)
| ~ test(X31) )
& ( ~ complement(X31,X32)
| c(X31) = X32
| ~ test(X31) ) ),
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(esk2_0,multiplication(esk1_0,c(esk3_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,
! [X23,X24] :
( ( multiplication(X23,X24) = zero
| ~ complement(X24,X23) )
& ( multiplication(X24,X23) = zero
| ~ complement(X24,X23) )
& ( addition(X23,X24) = one
| ~ complement(X24,X23) )
& ( multiplication(X23,X24) != zero
| multiplication(X24,X23) != zero
| addition(X23,X24) != one
| complement(X24,X23) ) ),
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,
! [X37,X38] : addition(X37,X38) = addition(X38,X37),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_22,negated_conjecture,
multiplication(esk2_0,addition(X1,multiplication(esk1_0,c(esk3_0)))) = multiplication(esk2_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,
! [X13] : multiplication(X13,one) = X13,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_27,negated_conjecture,
multiplication(esk2_0,esk1_0) != multiplication(multiplication(esk2_0,esk1_0),esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
multiplication(esk2_0,multiplication(esk1_0,addition(X1,c(esk3_0)))) = multiplication(esk2_0,multiplication(esk1_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(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,negated_conjecture,
multiplication(esk2_0,multiplication(esk1_0,esk3_0)) != multiplication(esk2_0,esk1_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.05/0.10 % Problem : KLE025+2 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n012.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 04:39:35 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.eUHT2EvJnw/E---3.1_6891.p
% 0.16/0.44 # Version: 3.1pre001
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # sh5l with pid 6972 completed with status 0
% 0.16/0.44 # Result found by sh5l
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.44 # Search class: FGUSM-FFMS21-SFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.44 # SAT001_MinMin_p005000_rr_RG with pid 6980 completed with status 0
% 0.16/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.44 # Search class: FGUSM-FFMS21-SFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 19
% 0.16/0.44 # Removed by relevancy pruning/SinE : 1
% 0.16/0.44 # Initial clauses : 26
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 26
% 0.16/0.44 # Processed clauses : 157
% 0.16/0.44 # ...of these trivial : 14
% 0.16/0.44 # ...subsumed : 35
% 0.16/0.44 # ...remaining for further processing : 108
% 0.16/0.44 # Other redundant clauses eliminated : 6
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 12
% 0.16/0.44 # Generated clauses : 619
% 0.16/0.44 # ...of the previous two non-redundant : 406
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 4
% 0.16/0.44 # Paramodulations : 613
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 6
% 0.16/0.44 # Total rewrite steps : 601
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 69
% 0.16/0.44 # Positive orientable unit clauses : 30
% 0.16/0.44 # Positive unorientable unit clauses: 3
% 0.16/0.44 # Negative unit clauses : 1
% 0.16/0.44 # Non-unit-clauses : 35
% 0.16/0.44 # Current number of unprocessed clauses: 292
% 0.16/0.44 # ...number of literals in the above : 539
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 38
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 267
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 265
% 0.16/0.44 # Non-unit clause-clause subsumptions : 33
% 0.16/0.44 # Unit Clause-clause subsumption calls : 10
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 46
% 0.16/0.44 # BW rewrite match successes : 41
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 7363
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.012 s
% 0.16/0.44 # System time : 0.002 s
% 0.16/0.44 # Total time : 0.014 s
% 0.16/0.44 # Maximum resident set size: 1708 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.013 s
% 0.16/0.44 # System time : 0.003 s
% 0.16/0.44 # Total time : 0.017 s
% 0.16/0.44 # Maximum resident set size: 1688 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------