TSTP Solution File: KLE141+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE141+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 36 ( 27 unt; 0 def)
% Number of atoms : 47 ( 30 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 22 ( 11 ~; 8 |; 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 : 49 ( 4 sgn; 28 !; 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.1pBQzn0Ojx/E---3.1_17614.p',infty_coinduction) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.1pBQzn0Ojx/E---3.1_17614.p',multiplicative_left_identity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/tmp.1pBQzn0Ojx/E---3.1_17614.p',additive_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.1pBQzn0Ojx/E---3.1_17614.p',order) ).
fof(idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.1pBQzn0Ojx/E---3.1_17614.p',idempotence) ).
fof(isolation,axiom,
! [X1] : strong_iteration(X1) = addition(star(X1),multiplication(strong_iteration(X1),zero)),
file('/export/starexec/sandbox/tmp/tmp.1pBQzn0Ojx/E---3.1_17614.p',isolation) ).
fof(goals,conjecture,
! [X4] : multiplication(strong_iteration(one),X4) = strong_iteration(one),
file('/export/starexec/sandbox/tmp/tmp.1pBQzn0Ojx/E---3.1_17614.p',goals) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.1pBQzn0Ojx/E---3.1_17614.p',multiplicative_associativity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/tmp.1pBQzn0Ojx/E---3.1_17614.p',left_annihilation) ).
fof(c_0_9,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_10,plain,
! [X12] : multiplication(one,X12) = X12,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_11,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X38] : addition(X38,zero) = X38,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_14,plain,
( leq(X1,multiplication(strong_iteration(one),X2))
| ~ leq(X1,addition(X1,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,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_17,plain,
! [X29] : addition(X29,X29) = X29,
inference(variable_rename,[status(thm)],[idempotence]) ).
cnf(c_0_18,plain,
( leq(X1,multiplication(strong_iteration(one),zero))
| ~ leq(X1,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X10] : strong_iteration(X10) = addition(star(X10),multiplication(strong_iteration(X10),zero)),
inference(variable_rename,[status(thm)],[isolation]) ).
cnf(c_0_22,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
leq(X1,multiplication(strong_iteration(one),zero)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
fof(c_0_24,negated_conjecture,
~ ! [X4] : multiplication(strong_iteration(one),X4) = strong_iteration(one),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_25,plain,
! [X15,X16,X17] : multiplication(X15,multiplication(X16,X17)) = multiplication(multiplication(X15,X16),X17),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_26,plain,
strong_iteration(X1) = addition(star(X1),multiplication(strong_iteration(X1),zero)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
addition(X1,multiplication(strong_iteration(one),zero)) = multiplication(strong_iteration(one),zero),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_28,plain,
! [X39] : multiplication(zero,X39) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_29,negated_conjecture,
multiplication(strong_iteration(one),esk1_0) != strong_iteration(one),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
cnf(c_0_30,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
multiplication(strong_iteration(one),zero) = strong_iteration(one),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
multiplication(strong_iteration(one),esk1_0) != strong_iteration(one),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
multiplication(strong_iteration(one),X1) = strong_iteration(one),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_31]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : KLE141+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n026.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Oct 3 05:07:59 EDT 2023
% 0.09/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.1pBQzn0Ojx/E---3.1_17614.p
% 0.15/0.41 # Version: 3.1pre001
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # Starting sh5l with 300s (1) cores
% 0.15/0.41 # new_bool_3 with pid 17692 completed with status 0
% 0.15/0.41 # Result found by new_bool_3
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.15/0.41 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.15/0.41 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 17696 completed with status 0
% 0.15/0.41 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.15/0.41 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.15/0.41 # Preprocessing time : 0.001 s
% 0.15/0.41 # Presaturation interreduction done
% 0.15/0.41
% 0.15/0.41 # Proof found!
% 0.15/0.41 # SZS status Theorem
% 0.15/0.41 # SZS output start CNFRefutation
% See solution above
% 0.15/0.41 # Parsed axioms : 19
% 0.15/0.41 # Removed by relevancy pruning/SinE : 0
% 0.15/0.41 # Initial clauses : 20
% 0.15/0.41 # Removed in clause preprocessing : 0
% 0.15/0.41 # Initial clauses in saturation : 20
% 0.15/0.41 # Processed clauses : 82
% 0.15/0.41 # ...of these trivial : 4
% 0.15/0.41 # ...subsumed : 4
% 0.15/0.41 # ...remaining for further processing : 74
% 0.15/0.41 # Other redundant clauses eliminated : 0
% 0.15/0.41 # Clauses deleted for lack of memory : 0
% 0.15/0.41 # Backward-subsumed : 0
% 0.15/0.41 # Backward-rewritten : 18
% 0.15/0.41 # Generated clauses : 354
% 0.15/0.41 # ...of the previous two non-redundant : 222
% 0.15/0.41 # ...aggressively subsumed : 0
% 0.15/0.41 # Contextual simplify-reflections : 1
% 0.15/0.41 # Paramodulations : 354
% 0.15/0.41 # Factorizations : 0
% 0.15/0.41 # NegExts : 0
% 0.15/0.41 # Equation resolutions : 0
% 0.15/0.41 # Total rewrite steps : 329
% 0.15/0.41 # Propositional unsat checks : 0
% 0.15/0.41 # Propositional check models : 0
% 0.15/0.41 # Propositional check unsatisfiable : 0
% 0.15/0.41 # Propositional clauses : 0
% 0.15/0.41 # Propositional clauses after purity: 0
% 0.15/0.41 # Propositional unsat core size : 0
% 0.15/0.41 # Propositional preprocessing time : 0.000
% 0.15/0.41 # Propositional encoding time : 0.000
% 0.15/0.41 # Propositional solver time : 0.000
% 0.15/0.41 # Success case prop preproc time : 0.000
% 0.15/0.41 # Success case prop encoding time : 0.000
% 0.15/0.41 # Success case prop solver time : 0.000
% 0.15/0.41 # Current number of processed clauses : 36
% 0.15/0.41 # Positive orientable unit clauses : 27
% 0.15/0.41 # Positive unorientable unit clauses: 1
% 0.15/0.41 # Negative unit clauses : 0
% 0.15/0.41 # Non-unit-clauses : 8
% 0.15/0.41 # Current number of unprocessed clauses: 176
% 0.15/0.41 # ...number of literals in the above : 289
% 0.15/0.41 # Current number of archived formulas : 0
% 0.15/0.41 # Current number of archived clauses : 38
% 0.15/0.41 # Clause-clause subsumption calls (NU) : 32
% 0.15/0.41 # Rec. Clause-clause subsumption calls : 32
% 0.15/0.41 # Non-unit clause-clause subsumptions : 5
% 0.15/0.41 # Unit Clause-clause subsumption calls : 3
% 0.15/0.41 # Rewrite failures with RHS unbound : 0
% 0.15/0.41 # BW rewrite match attempts : 44
% 0.15/0.41 # BW rewrite match successes : 34
% 0.15/0.41 # Condensation attempts : 0
% 0.15/0.41 # Condensation successes : 0
% 0.15/0.41 # Termbank termtop insertions : 4574
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.009 s
% 0.15/0.41 # System time : 0.001 s
% 0.15/0.41 # Total time : 0.010 s
% 0.15/0.41 # Maximum resident set size: 1708 pages
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.010 s
% 0.15/0.41 # System time : 0.003 s
% 0.15/0.41 # Total time : 0.013 s
% 0.15/0.41 # Maximum resident set size: 1688 pages
% 0.15/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------