TSTP Solution File: KLE148+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE148+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:29 EDT 2023
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 27 unt; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 44 ( 3 sgn; 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] :
( multiplication(X4,X5) = zero
=> multiplication(X4,strong_iteration(X5)) = X4 ),
file('/export/starexec/sandbox/tmp/tmp.zFEBuABikm/E---3.1_2757.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.zFEBuABikm/E---3.1_2757.p',multiplicative_associativity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/tmp.zFEBuABikm/E---3.1_2757.p',left_annihilation) ).
fof(distributivity1,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.zFEBuABikm/E---3.1_2757.p',distributivity1) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/tmp.zFEBuABikm/E---3.1_2757.p',additive_identity) ).
fof(infty_unfold1,axiom,
! [X1] : strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
file('/export/starexec/sandbox/tmp/tmp.zFEBuABikm/E---3.1_2757.p',infty_unfold1) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.zFEBuABikm/E---3.1_2757.p',additive_commutativity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.zFEBuABikm/E---3.1_2757.p',multiplicative_right_identity) ).
fof(c_0_8,negated_conjecture,
~ ! [X4,X5] :
( multiplication(X4,X5) = zero
=> multiplication(X4,strong_iteration(X5)) = X4 ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_9,plain,
! [X8,X9,X10] : multiplication(X8,multiplication(X9,X10)) = multiplication(multiplication(X8,X9),X10),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_10,negated_conjecture,
( multiplication(esk1_0,esk2_0) = zero
& multiplication(esk1_0,strong_iteration(esk2_0)) != esk1_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,plain,
! [X19] : multiplication(zero,X19) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_12,plain,
! [X13,X14,X15] : multiplication(X13,addition(X14,X15)) = addition(multiplication(X13,X14),multiplication(X13,X15)),
inference(variable_rename,[status(thm)],[distributivity1]) ).
cnf(c_0_13,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
multiplication(esk1_0,esk2_0) = zero,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X33] : addition(X33,zero) = X33,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_17,plain,
! [X28] : strong_iteration(X28) = addition(multiplication(X28,strong_iteration(X28)),one),
inference(variable_rename,[status(thm)],[infty_unfold1]) ).
fof(c_0_18,plain,
! [X34,X35] : addition(X34,X35) = addition(X35,X34),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_19,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
multiplication(esk1_0,multiplication(esk2_0,X1)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_21,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,plain,
! [X11] : multiplication(X11,one) = X11,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_25,negated_conjecture,
multiplication(esk1_0,addition(X1,multiplication(esk2_0,X2))) = multiplication(esk1_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_26,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
multiplication(esk1_0,strong_iteration(esk2_0)) != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE148+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n001.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 05:29:22 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.zFEBuABikm/E---3.1_2757.p
% 0.19/0.49 # Version: 3.1pre001
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # sh5l with pid 2867 completed with status 0
% 0.19/0.49 # Result found by sh5l
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.49 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.19/0.49 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.19/0.49 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2876 completed with status 0
% 0.19/0.49 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.49 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.19/0.49 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 19
% 0.19/0.49 # Removed by relevancy pruning/SinE : 0
% 0.19/0.49 # Initial clauses : 21
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 21
% 0.19/0.49 # Processed clauses : 70
% 0.19/0.49 # ...of these trivial : 7
% 0.19/0.49 # ...subsumed : 4
% 0.19/0.49 # ...remaining for further processing : 59
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 0
% 0.19/0.49 # Backward-rewritten : 2
% 0.19/0.49 # Generated clauses : 281
% 0.19/0.49 # ...of the previous two non-redundant : 204
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 281
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Total rewrite steps : 238
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 36
% 0.19/0.49 # Positive orientable unit clauses : 28
% 0.19/0.49 # Positive unorientable unit clauses: 2
% 0.19/0.49 # Negative unit clauses : 1
% 0.19/0.49 # Non-unit-clauses : 5
% 0.19/0.49 # Current number of unprocessed clauses: 164
% 0.19/0.49 # ...number of literals in the above : 228
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 23
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 11
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 11
% 0.19/0.49 # Non-unit clause-clause subsumptions : 0
% 0.19/0.49 # Unit Clause-clause subsumption calls : 1
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 21
% 0.19/0.49 # BW rewrite match successes : 17
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 3684
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.006 s
% 0.19/0.49 # System time : 0.003 s
% 0.19/0.49 # Total time : 0.009 s
% 0.19/0.49 # Maximum resident set size: 1744 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.006 s
% 0.19/0.49 # System time : 0.006 s
% 0.19/0.49 # Total time : 0.012 s
% 0.19/0.49 # Maximum resident set size: 1688 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------