TSTP Solution File: KLE142+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---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 : n014.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:27 EDT 2023
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% 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/sandbox2/tmp/tmp.srOUmsOXeh/E---3.1_32065.p',infty_coinduction) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.srOUmsOXeh/E---3.1_32065.p',multiplicative_left_identity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.srOUmsOXeh/E---3.1_32065.p',additive_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.srOUmsOXeh/E---3.1_32065.p',order) ).
fof(idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.srOUmsOXeh/E---3.1_32065.p',idempotence) ).
fof(isolation,axiom,
! [X1] : strong_iteration(X1) = addition(star(X1),multiplication(strong_iteration(X1),zero)),
file('/export/starexec/sandbox2/tmp/tmp.srOUmsOXeh/E---3.1_32065.p',isolation) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.srOUmsOXeh/E---3.1_32065.p',additive_commutativity) ).
fof(goals,conjecture,
! [X4] : strong_iteration(strong_iteration(X4)) = strong_iteration(one),
file('/export/starexec/sandbox2/tmp/tmp.srOUmsOXeh/E---3.1_32065.p',goals) ).
fof(c_0_8,plain,
! [X33,X34,X35] :
( ~ leq(X35,addition(multiplication(X33,X35),X34))
| leq(X35,multiplication(strong_iteration(X33),X34)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[infty_coinduction])]) ).
fof(c_0_9,plain,
! [X16] : multiplication(one,X16) = X16,
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,
! [X10] : addition(X10,zero) = X10,
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,
! [X37,X38] :
( ( ~ leq(X37,X38)
| addition(X37,X38) = X38 )
& ( addition(X37,X38) != X38
| leq(X37,X38) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
fof(c_0_16,plain,
! [X11] : addition(X11,X11) = X11,
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,
! [X36] : strong_iteration(X36) = addition(star(X36),multiplication(strong_iteration(X36),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,
! [X5,X6] : addition(X5,X6) = addition(X6,X5),
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.03/0.11 % Problem : KLE142+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 04:48:34 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.srOUmsOXeh/E---3.1_32065.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32143 completed with status 0
% 0.17/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.17/0.46 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.46 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.17/0.46 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with 136s (1) cores
% 0.17/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32149 completed with status 0
% 0.17/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46 # No SInE strategy applied
% 0.17/0.46 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.17/0.46 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.46 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Theorem
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 19
% 0.17/0.46 # Removed by relevancy pruning/SinE : 0
% 0.17/0.46 # Initial clauses : 20
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 20
% 0.17/0.46 # Processed clauses : 159
% 0.17/0.46 # ...of these trivial : 21
% 0.17/0.46 # ...subsumed : 32
% 0.17/0.46 # ...remaining for further processing : 106
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 1
% 0.17/0.46 # Backward-rewritten : 27
% 0.17/0.46 # Generated clauses : 915
% 0.17/0.46 # ...of the previous two non-redundant : 560
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 915
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 0
% 0.17/0.46 # Total rewrite steps : 836
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 58
% 0.17/0.46 # Positive orientable unit clauses : 37
% 0.17/0.46 # Positive unorientable unit clauses: 3
% 0.17/0.46 # Negative unit clauses : 0
% 0.17/0.46 # Non-unit-clauses : 18
% 0.17/0.46 # Current number of unprocessed clauses: 418
% 0.17/0.46 # ...number of literals in the above : 651
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 48
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 91
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 91
% 0.17/0.46 # Non-unit clause-clause subsumptions : 15
% 0.17/0.46 # Unit Clause-clause subsumption calls : 10
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 74
% 0.17/0.46 # BW rewrite match successes : 58
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 9302
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.012 s
% 0.17/0.46 # System time : 0.003 s
% 0.17/0.46 # Total time : 0.015 s
% 0.17/0.46 # Maximum resident set size: 1744 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.057 s
% 0.17/0.46 # System time : 0.012 s
% 0.17/0.46 # Total time : 0.069 s
% 0.17/0.46 # Maximum resident set size: 1684 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------