TSTP Solution File: KLE022+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE022+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:53 EDT 2023
% Result : Theorem 272.28s 136.61s
% Output : CNFRefutation 272.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 13 unt; 0 def)
% Number of atoms : 53 ( 30 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 48 ( 20 ~; 16 |; 7 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 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.gNPXlhnl0w/E---3.1_9107.p',test_3) ).
fof(goals,conjecture,
! [X4,X5] :
( test(X5)
=> X4 = addition(multiplication(X4,X5),multiplication(X4,c(X5))) ),
file('/export/starexec/sandbox2/tmp/tmp.gNPXlhnl0w/E---3.1_9107.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.gNPXlhnl0w/E---3.1_9107.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.gNPXlhnl0w/E---3.1_9107.p',right_distributivity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.gNPXlhnl0w/E---3.1_9107.p',additive_commutativity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.gNPXlhnl0w/E---3.1_9107.p',multiplicative_right_identity) ).
fof(c_0_6,plain,
! [X23,X24] :
( ( c(X23) != X24
| complement(X23,X24)
| ~ test(X23) )
& ( ~ complement(X23,X24)
| c(X23) = X24
| ~ test(X23) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X4,X5] :
( test(X5)
=> X4 = addition(multiplication(X4,X5),multiplication(X4,c(X5))) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_8,plain,
! [X30,X31] :
( ( multiplication(X30,X31) = zero
| ~ complement(X31,X30) )
& ( multiplication(X31,X30) = zero
| ~ complement(X31,X30) )
& ( addition(X30,X31) = one
| ~ complement(X31,X30) )
& ( multiplication(X30,X31) != zero
| multiplication(X31,X30) != zero
| addition(X30,X31) != one
| complement(X31,X30) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
cnf(c_0_9,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,negated_conjecture,
( test(esk2_0)
& esk1_0 != addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_11,plain,
! [X14,X15,X16] : multiplication(X14,addition(X15,X16)) = addition(multiplication(X14,X15),multiplication(X14,X16)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_12,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X8,X9] : addition(X8,X9) = addition(X9,X8),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_15,negated_conjecture,
esk1_0 != addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
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,plain,
( addition(c(X1),X1) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_12,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,
! [X35] : multiplication(X35,one) = X35,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_20,negated_conjecture,
multiplication(esk1_0,addition(esk2_0,c(esk2_0))) != esk1_0,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : KLE022+1 : TPTP v8.1.2. Released v4.0.0.
% 0.15/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n022.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 04:52:39 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.24/0.52 Running first-order theorem proving
% 0.24/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.gNPXlhnl0w/E---3.1_9107.p
% 272.28/136.61 # Version: 3.1pre001
% 272.28/136.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 272.28/136.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.28/136.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 272.28/136.61 # Starting new_bool_3 with 300s (1) cores
% 272.28/136.61 # Starting new_bool_1 with 300s (1) cores
% 272.28/136.61 # Starting sh5l with 300s (1) cores
% 272.28/136.61 # new_bool_1 with pid 9187 completed with status 0
% 272.28/136.61 # Result found by new_bool_1
% 272.28/136.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 272.28/136.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.28/136.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 272.28/136.61 # Starting new_bool_3 with 300s (1) cores
% 272.28/136.61 # Starting new_bool_1 with 300s (1) cores
% 272.28/136.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 272.28/136.61 # Search class: FGUSM-FFSF21-MFFFFFNN
% 272.28/136.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.28/136.61 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 272.28/136.61 # SAT001_MinMin_p005000_rr_RG with pid 9189 completed with status 0
% 272.28/136.61 # Result found by SAT001_MinMin_p005000_rr_RG
% 272.28/136.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 272.28/136.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.28/136.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 272.28/136.61 # Starting new_bool_3 with 300s (1) cores
% 272.28/136.61 # Starting new_bool_1 with 300s (1) cores
% 272.28/136.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 272.28/136.61 # Search class: FGUSM-FFSF21-MFFFFFNN
% 272.28/136.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 272.28/136.61 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 272.28/136.61 # Preprocessing time : 0.001 s
% 272.28/136.61 # Presaturation interreduction done
% 272.28/136.61
% 272.28/136.61 # Proof found!
% 272.28/136.61 # SZS status Theorem
% 272.28/136.61 # SZS output start CNFRefutation
% See solution above
% 272.28/136.61 # Parsed axioms : 17
% 272.28/136.61 # Removed by relevancy pruning/SinE : 1
% 272.28/136.61 # Initial clauses : 22
% 272.28/136.61 # Removed in clause preprocessing : 0
% 272.28/136.61 # Initial clauses in saturation : 22
% 272.28/136.61 # Processed clauses : 56
% 272.28/136.61 # ...of these trivial : 1
% 272.28/136.61 # ...subsumed : 0
% 272.28/136.61 # ...remaining for further processing : 55
% 272.28/136.61 # Other redundant clauses eliminated : 1
% 272.28/136.61 # Clauses deleted for lack of memory : 0
% 272.28/136.61 # Backward-subsumed : 0
% 272.28/136.61 # Backward-rewritten : 2
% 272.28/136.61 # Generated clauses : 98
% 272.28/136.61 # ...of the previous two non-redundant : 50
% 272.28/136.61 # ...aggressively subsumed : 0
% 272.28/136.61 # Contextual simplify-reflections : 1
% 272.28/136.61 # Paramodulations : 97
% 272.28/136.61 # Factorizations : 0
% 272.28/136.61 # NegExts : 0
% 272.28/136.61 # Equation resolutions : 1
% 272.28/136.61 # Total rewrite steps : 89
% 272.28/136.61 # Propositional unsat checks : 0
% 272.28/136.61 # Propositional check models : 0
% 272.28/136.61 # Propositional check unsatisfiable : 0
% 272.28/136.61 # Propositional clauses : 0
% 272.28/136.61 # Propositional clauses after purity: 0
% 272.28/136.61 # Propositional unsat core size : 0
% 272.28/136.61 # Propositional preprocessing time : 0.000
% 272.28/136.61 # Propositional encoding time : 0.000
% 272.28/136.61 # Propositional solver time : 0.000
% 272.28/136.61 # Success case prop preproc time : 0.000
% 272.28/136.61 # Success case prop encoding time : 0.000
% 272.28/136.61 # Success case prop solver time : 0.000
% 272.28/136.61 # Current number of processed clauses : 30
% 272.28/136.61 # Positive orientable unit clauses : 13
% 272.28/136.61 # Positive unorientable unit clauses: 1
% 272.28/136.61 # Negative unit clauses : 1
% 272.28/136.61 # Non-unit-clauses : 15
% 272.28/136.61 # Current number of unprocessed clauses: 37
% 272.28/136.61 # ...number of literals in the above : 61
% 272.28/136.61 # Current number of archived formulas : 0
% 272.28/136.61 # Current number of archived clauses : 24
% 272.28/136.61 # Clause-clause subsumption calls (NU) : 19
% 272.28/136.61 # Rec. Clause-clause subsumption calls : 19
% 272.28/136.61 # Non-unit clause-clause subsumptions : 1
% 272.28/136.61 # Unit Clause-clause subsumption calls : 1
% 272.28/136.61 # Rewrite failures with RHS unbound : 0
% 272.28/136.61 # BW rewrite match attempts : 30
% 272.28/136.61 # BW rewrite match successes : 25
% 272.28/136.61 # Condensation attempts : 0
% 272.28/136.61 # Condensation successes : 0
% 272.28/136.61 # Termbank termtop insertions : 1750
% 272.28/136.61
% 272.28/136.61 # -------------------------------------------------
% 272.28/136.61 # User time : 0.006 s
% 272.28/136.61 # System time : 0.001 s
% 272.28/136.61 # Total time : 0.007 s
% 272.28/136.61 # Maximum resident set size: 1732 pages
% 272.28/136.61
% 272.28/136.61 # -------------------------------------------------
% 272.28/136.61 # User time : 0.008 s
% 272.28/136.61 # System time : 0.003 s
% 272.28/136.61 # Total time : 0.011 s
% 272.28/136.61 # Maximum resident set size: 1684 pages
% 272.28/136.61 % E---3.1 exiting
% 272.28/136.61 % E---3.1 exiting
%------------------------------------------------------------------------------