TSTP Solution File: KLE007+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE007+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:47 EDT 2023
% Result : Theorem 0.23s 0.54s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 17 unt; 0 def)
% Number of atoms : 69 ( 29 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 60 ( 22 ~; 19 |; 13 &)
% ( 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 : 36 ( 0 sgn; 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Bk7QfuubRj/E---3.1_6442.p',test_3) ).
fof(goals,conjecture,
! [X4,X5] :
( ( test(X5)
& test(X4) )
=> ( leq(one,addition(multiplication(addition(X4,c(X4)),X5),multiplication(addition(X4,c(X4)),c(X5))))
& leq(addition(multiplication(addition(X4,c(X4)),X5),multiplication(addition(X4,c(X4)),c(X5))),one) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Bk7QfuubRj/E---3.1_6442.p',goals) ).
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.Bk7QfuubRj/E---3.1_6442.p',test_2) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.Bk7QfuubRj/E---3.1_6442.p',additive_commutativity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.Bk7QfuubRj/E---3.1_6442.p',order) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.Bk7QfuubRj/E---3.1_6442.p',additive_idempotence) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.Bk7QfuubRj/E---3.1_6442.p',multiplicative_left_identity) ).
fof(c_0_7,plain,
! [X29,X30] :
( ( c(X29) != X30
| complement(X29,X30)
| ~ test(X29) )
& ( ~ complement(X29,X30)
| c(X29) = X30
| ~ test(X29) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
fof(c_0_8,negated_conjecture,
~ ! [X4,X5] :
( ( test(X5)
& test(X4) )
=> ( leq(one,addition(multiplication(addition(X4,c(X4)),X5),multiplication(addition(X4,c(X4)),c(X5))))
& leq(addition(multiplication(addition(X4,c(X4)),X5),multiplication(addition(X4,c(X4)),c(X5))),one) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_9,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,negated_conjecture,
( test(esk2_0)
& test(esk1_0)
& ( ~ leq(one,addition(multiplication(addition(esk1_0,c(esk1_0)),esk2_0),multiplication(addition(esk1_0,c(esk1_0)),c(esk2_0))))
| ~ leq(addition(multiplication(addition(esk1_0,c(esk1_0)),esk2_0),multiplication(addition(esk1_0,c(esk1_0)),c(esk2_0))),one) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,plain,
! [X12,X13] :
( ( multiplication(X12,X13) = zero
| ~ complement(X13,X12) )
& ( multiplication(X13,X12) = zero
| ~ complement(X13,X12) )
& ( addition(X12,X13) = one
| ~ complement(X13,X12) )
& ( multiplication(X12,X13) != zero
| multiplication(X13,X12) != zero
| addition(X12,X13) != one
| complement(X13,X12) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
cnf(c_0_12,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
test(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X14,X15] : addition(X14,X15) = addition(X15,X14),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_15,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X8,X9] :
( ( ~ leq(X8,X9)
| addition(X8,X9) = X9 )
& ( addition(X8,X9) != X9
| leq(X8,X9) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
fof(c_0_17,plain,
! [X19] : addition(X19,X19) = X19,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_18,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
complement(esk1_0,c(esk1_0)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_21,plain,
! [X11] : multiplication(one,X11) = X11,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_22,negated_conjecture,
complement(esk2_0,c(esk2_0)),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_23,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
( ~ leq(one,addition(multiplication(addition(esk1_0,c(esk1_0)),esk2_0),multiplication(addition(esk1_0,c(esk1_0)),c(esk2_0))))
| ~ leq(addition(multiplication(addition(esk1_0,c(esk1_0)),esk2_0),multiplication(addition(esk1_0,c(esk1_0)),c(esk2_0))),one) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,negated_conjecture,
addition(esk1_0,c(esk1_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_27,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
addition(esk2_0,c(esk2_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_22]),c_0_20]) ).
cnf(c_0_29,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_27]),c_0_28]),c_0_29]),c_0_27]),c_0_27]),c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : KLE007+2 : TPTP v8.1.2. Released v4.0.0.
% 0.16/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n002.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:06:15 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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.Bk7QfuubRj/E---3.1_6442.p
% 0.23/0.54 # Version: 3.1pre001
% 0.23/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # new_bool_3 with pid 6535 completed with status 0
% 0.23/0.54 # Result found by new_bool_3
% 0.23/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.54 # Search class: FGHSM-FFMF21-MFFFFFNN
% 0.23/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 181s (1) cores
% 0.23/0.54 # G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with pid 6545 completed with status 0
% 0.23/0.54 # Result found by G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN
% 0.23/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.54 # Search class: FGHSM-FFMF21-MFFFFFNN
% 0.23/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 181s (1) cores
% 0.23/0.54 # Preprocessing time : 0.001 s
% 0.23/0.54 # Presaturation interreduction done
% 0.23/0.54
% 0.23/0.54 # Proof found!
% 0.23/0.54 # SZS status Theorem
% 0.23/0.54 # SZS output start CNFRefutation
% See solution above
% 0.23/0.54 # Parsed axioms : 17
% 0.23/0.54 # Removed by relevancy pruning/SinE : 0
% 0.23/0.54 # Initial clauses : 25
% 0.23/0.54 # Removed in clause preprocessing : 0
% 0.23/0.54 # Initial clauses in saturation : 25
% 0.23/0.54 # Processed clauses : 73
% 0.23/0.54 # ...of these trivial : 1
% 0.23/0.54 # ...subsumed : 1
% 0.23/0.54 # ...remaining for further processing : 71
% 0.23/0.54 # Other redundant clauses eliminated : 5
% 0.23/0.54 # Clauses deleted for lack of memory : 0
% 0.23/0.54 # Backward-subsumed : 0
% 0.23/0.54 # Backward-rewritten : 0
% 0.23/0.54 # Generated clauses : 149
% 0.23/0.54 # ...of the previous two non-redundant : 91
% 0.23/0.54 # ...aggressively subsumed : 0
% 0.23/0.54 # Contextual simplify-reflections : 0
% 0.23/0.54 # Paramodulations : 144
% 0.23/0.54 # Factorizations : 0
% 0.23/0.54 # NegExts : 0
% 0.23/0.54 # Equation resolutions : 5
% 0.23/0.54 # Total rewrite steps : 161
% 0.23/0.54 # Propositional unsat checks : 0
% 0.23/0.54 # Propositional check models : 0
% 0.23/0.54 # Propositional check unsatisfiable : 0
% 0.23/0.54 # Propositional clauses : 0
% 0.23/0.54 # Propositional clauses after purity: 0
% 0.23/0.54 # Propositional unsat core size : 0
% 0.23/0.54 # Propositional preprocessing time : 0.000
% 0.23/0.54 # Propositional encoding time : 0.000
% 0.23/0.54 # Propositional solver time : 0.000
% 0.23/0.54 # Success case prop preproc time : 0.000
% 0.23/0.54 # Success case prop encoding time : 0.000
% 0.23/0.54 # Success case prop solver time : 0.000
% 0.23/0.54 # Current number of processed clauses : 45
% 0.23/0.54 # Positive orientable unit clauses : 27
% 0.23/0.54 # Positive unorientable unit clauses: 1
% 0.23/0.54 # Negative unit clauses : 0
% 0.23/0.54 # Non-unit-clauses : 17
% 0.23/0.54 # Current number of unprocessed clauses: 62
% 0.23/0.54 # ...number of literals in the above : 97
% 0.23/0.54 # Current number of archived formulas : 0
% 0.23/0.54 # Current number of archived clauses : 25
% 0.23/0.54 # Clause-clause subsumption calls (NU) : 45
% 0.23/0.54 # Rec. Clause-clause subsumption calls : 39
% 0.23/0.54 # Non-unit clause-clause subsumptions : 1
% 0.23/0.54 # Unit Clause-clause subsumption calls : 38
% 0.23/0.54 # Rewrite failures with RHS unbound : 0
% 0.23/0.54 # BW rewrite match attempts : 21
% 0.23/0.54 # BW rewrite match successes : 16
% 0.23/0.54 # Condensation attempts : 0
% 0.23/0.54 # Condensation successes : 0
% 0.23/0.54 # Termbank termtop insertions : 2658
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.006 s
% 0.23/0.54 # System time : 0.003 s
% 0.23/0.54 # Total time : 0.009 s
% 0.23/0.54 # Maximum resident set size: 1740 pages
% 0.23/0.54
% 0.23/0.54 # -------------------------------------------------
% 0.23/0.54 # User time : 0.007 s
% 0.23/0.54 # System time : 0.006 s
% 0.23/0.54 # Total time : 0.013 s
% 0.23/0.54 # Maximum resident set size: 1688 pages
% 0.23/0.54 % E---3.1 exiting
% 0.23/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------