TSTP Solution File: KLE142+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE142+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:05:15 EDT 2023
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 30 unt; 0 def)
% Number of atoms : 52 ( 30 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 12 ~; 9 |; 1 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 52 ( 10 sgn; 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(infty_coinduction,axiom,
! [X1,X2,X3] :
( leq(X3,addition(multiplication(X1,X3),X2))
=> leq(X3,multiplication(strong_iteration(X1),X2)) ),
file('/export/starexec/sandbox/tmp/tmp.dzaCP1eyZg/E---3.1_14276.p',infty_coinduction) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.dzaCP1eyZg/E---3.1_14276.p',multiplicative_left_identity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/tmp.dzaCP1eyZg/E---3.1_14276.p',additive_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.dzaCP1eyZg/E---3.1_14276.p',order) ).
fof(idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.dzaCP1eyZg/E---3.1_14276.p',idempotence) ).
fof(isolation,axiom,
! [X1] : strong_iteration(X1) = addition(star(X1),multiplication(strong_iteration(X1),zero)),
file('/export/starexec/sandbox/tmp/tmp.dzaCP1eyZg/E---3.1_14276.p',isolation) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.dzaCP1eyZg/E---3.1_14276.p',additive_commutativity) ).
fof(goals,conjecture,
! [X4] : strong_iteration(strong_iteration(X4)) = strong_iteration(one),
file('/export/starexec/sandbox/tmp/tmp.dzaCP1eyZg/E---3.1_14276.p',goals) ).
fof(c_0_8,plain,
! [X7,X8,X9] :
( ~ leq(X9,addition(multiplication(X7,X9),X8))
| leq(X9,multiplication(strong_iteration(X7),X8)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[infty_coinduction])]) ).
fof(c_0_9,plain,
! [X12] : multiplication(one,X12) = X12,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_10,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X38] : addition(X38,zero) = X38,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_13,plain,
( leq(X1,multiplication(strong_iteration(one),X2))
| ~ leq(X1,addition(X1,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X36,X37] :
( ( ~ leq(X36,X37)
| addition(X36,X37) = X37 )
& ( addition(X36,X37) != X37
| leq(X36,X37) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
fof(c_0_16,plain,
! [X20] : addition(X20,X20) = X20,
inference(variable_rename,[status(thm)],[idempotence]) ).
cnf(c_0_17,plain,
( leq(X1,multiplication(strong_iteration(one),zero))
| ~ leq(X1,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X10] : strong_iteration(X10) = addition(star(X10),multiplication(strong_iteration(X10),zero)),
inference(variable_rename,[status(thm)],[isolation]) ).
cnf(c_0_21,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
leq(X1,multiplication(strong_iteration(one),zero)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_23,plain,
strong_iteration(X1) = addition(star(X1),multiplication(strong_iteration(X1),zero)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
addition(X1,multiplication(strong_iteration(one),zero)) = multiplication(strong_iteration(one),zero),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
multiplication(strong_iteration(one),zero) = strong_iteration(one),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
addition(X1,strong_iteration(one)) = strong_iteration(one),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_25]) ).
cnf(c_0_27,plain,
leq(X1,strong_iteration(one)),
inference(rw,[status(thm)],[c_0_22,c_0_25]) ).
fof(c_0_28,plain,
! [X15,X16] : addition(X15,X16) = addition(X16,X15),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_29,plain,
( leq(X1,multiplication(strong_iteration(X2),zero))
| ~ leq(X1,multiplication(X2,X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_30,plain,
leq(X1,multiplication(strong_iteration(X2),strong_iteration(one))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_26]),c_0_27])]) ).
cnf(c_0_31,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_32,negated_conjecture,
~ ! [X4] : strong_iteration(strong_iteration(X4)) = strong_iteration(one),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_33,plain,
leq(strong_iteration(one),multiplication(strong_iteration(strong_iteration(X1)),zero)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
addition(strong_iteration(one),X1) = strong_iteration(one),
inference(spm,[status(thm)],[c_0_31,c_0_26]) ).
fof(c_0_35,negated_conjecture,
strong_iteration(strong_iteration(esk1_0)) != strong_iteration(one),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])]) ).
cnf(c_0_36,plain,
multiplication(strong_iteration(strong_iteration(X1)),zero) = strong_iteration(one),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_33]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
strong_iteration(strong_iteration(esk1_0)) != strong_iteration(one),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_38,plain,
strong_iteration(strong_iteration(X1)) = strong_iteration(one),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_36]),c_0_26]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : KLE142+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n023.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 05:10:07 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.dzaCP1eyZg/E---3.1_14276.p
% 0.15/0.43 # Version: 3.1pre001
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # new_bool_1 with pid 14355 completed with status 0
% 0.15/0.43 # Result found by new_bool_1
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.15/0.43 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.15/0.43 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 14363 completed with status 0
% 0.15/0.43 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.15/0.43 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 19
% 0.15/0.43 # Removed by relevancy pruning/SinE : 0
% 0.15/0.43 # Initial clauses : 20
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 20
% 0.15/0.43 # Processed clauses : 173
% 0.15/0.43 # ...of these trivial : 16
% 0.15/0.43 # ...subsumed : 38
% 0.15/0.43 # ...remaining for further processing : 119
% 0.15/0.43 # Other redundant clauses eliminated : 0
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 3
% 0.15/0.43 # Backward-rewritten : 28
% 0.15/0.43 # Generated clauses : 1136
% 0.15/0.43 # ...of the previous two non-redundant : 670
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 0
% 0.15/0.43 # Paramodulations : 1136
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 0
% 0.15/0.43 # Total rewrite steps : 1179
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 68
% 0.15/0.43 # Positive orientable unit clauses : 47
% 0.15/0.43 # Positive unorientable unit clauses: 3
% 0.15/0.43 # Negative unit clauses : 0
% 0.15/0.43 # Non-unit-clauses : 18
% 0.15/0.43 # Current number of unprocessed clauses: 515
% 0.15/0.43 # ...number of literals in the above : 770
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 51
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 102
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 102
% 0.15/0.43 # Non-unit clause-clause subsumptions : 22
% 0.15/0.43 # Unit Clause-clause subsumption calls : 14
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 80
% 0.15/0.43 # BW rewrite match successes : 59
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 11811
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.015 s
% 0.15/0.43 # System time : 0.003 s
% 0.15/0.43 # Total time : 0.018 s
% 0.15/0.43 # Maximum resident set size: 1736 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.015 s
% 0.15/0.43 # System time : 0.005 s
% 0.15/0.43 # Total time : 0.020 s
% 0.15/0.43 # Maximum resident set size: 1688 pages
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------