TSTP Solution File: KLE170+1.002 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE170+1.002 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:32 EDT 2023
% Result : Theorem 3.02s 0.84s
% Output : CNFRefutation 3.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 56 ( 51 unt; 0 def)
% Number of atoms : 63 ( 38 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 14 ( 7 ~; 5 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 91 ( 6 sgn; 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.00WXWOotK4/E---3.1_15076.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.00WXWOotK4/E---3.1_15076.p',additive_idempotence) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.00WXWOotK4/E---3.1_15076.p',order) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.00WXWOotK4/E---3.1_15076.p',additive_commutativity) ).
fof(star_unfold_left,axiom,
! [X1] : leq(addition(one,multiplication(star(X1),X1)),star(X1)),
file('/export/starexec/sandbox/tmp/tmp.00WXWOotK4/E---3.1_15076.p',star_unfold_left) ).
fof(star_unfold_right,axiom,
! [X1] : leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox/tmp/tmp.00WXWOotK4/E---3.1_15076.p',star_unfold_right) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.00WXWOotK4/E---3.1_15076.p',left_distributivity) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.00WXWOotK4/E---3.1_15076.p',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.00WXWOotK4/E---3.1_15076.p',multiplicative_right_identity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.00WXWOotK4/E---3.1_15076.p',multiplicative_left_identity) ).
fof(a,conjecture,
leq(multiplication(a,a),star(a)),
file('/export/starexec/sandbox/tmp/tmp.00WXWOotK4/E---3.1_15076.p',a) ).
fof(c_0_11,plain,
! [X6,X7,X8] : addition(X8,addition(X7,X6)) = addition(addition(X8,X7),X6),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_12,plain,
! [X10] : addition(X10,X10) = X10,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_13,plain,
! [X24,X25] :
( ( ~ leq(X24,X25)
| addition(X24,X25) = X25 )
& ( addition(X24,X25) != X25
| leq(X24,X25) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
cnf(c_0_14,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X4,X5] : addition(X4,X5) = addition(X5,X4),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_17,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X27] : leq(addition(one,multiplication(star(X27),X27)),star(X27)),
inference(variable_rename,[status(thm)],[star_unfold_left]) ).
fof(c_0_21,plain,
! [X26] : leq(addition(one,multiplication(X26,star(X26))),star(X26)),
inference(variable_rename,[status(thm)],[star_unfold_right]) ).
cnf(c_0_22,plain,
leq(X1,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_24,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,plain,
leq(addition(one,multiplication(star(X1),X1)),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_26,plain,
! [X19,X20,X21] : multiplication(addition(X19,X20),X21) = addition(multiplication(X19,X21),multiplication(X20,X21)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_27,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
leq(X1,addition(X2,addition(X3,X1))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
addition(one,addition(star(X1),multiplication(star(X1),X1))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_14]),c_0_19]) ).
fof(c_0_30,plain,
! [X16,X17,X18] : multiplication(X16,addition(X17,X18)) = addition(multiplication(X16,X17),multiplication(X16,X18)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_31,plain,
! [X14] : multiplication(X14,one) = X14,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_32,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
addition(one,addition(star(X1),multiplication(X1,star(X1)))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_27]),c_0_14]),c_0_19]) ).
fof(c_0_34,plain,
! [X15] : multiplication(one,X15) = X15,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_35,plain,
leq(multiplication(star(X1),X1),star(X1)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,plain,
( leq(multiplication(X1,X2),multiplication(X3,X2))
| multiplication(addition(X1,X3),X2) != multiplication(X3,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_32]) ).
cnf(c_0_39,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_18,c_0_33]) ).
cnf(c_0_40,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,plain,
addition(star(X1),multiplication(star(X1),X1)) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_35]),c_0_19]) ).
cnf(c_0_42,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_19]) ).
cnf(c_0_43,plain,
leq(X1,multiplication(star(X2),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_44,plain,
multiplication(star(X1),addition(X1,one)) = star(X1),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
leq(addition(X1,one),star(X1)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,plain,
addition(X1,star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_45]),c_0_14]),c_0_39]) ).
cnf(c_0_47,plain,
leq(multiplication(X1,X2),multiplication(star(X1),X2)),
inference(spm,[status(thm)],[c_0_38,c_0_46]) ).
cnf(c_0_48,plain,
multiplication(star(X1),addition(one,X1)) = star(X1),
inference(spm,[status(thm)],[c_0_44,c_0_19]) ).
cnf(c_0_49,plain,
leq(multiplication(X1,addition(one,X1)),star(X1)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
fof(c_0_50,negated_conjecture,
~ leq(multiplication(a,a),star(a)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[a])]) ).
cnf(c_0_51,plain,
leq(multiplication(X1,X2),addition(X3,multiplication(X1,addition(X4,X2)))),
inference(spm,[status(thm)],[c_0_28,c_0_36]) ).
cnf(c_0_52,plain,
addition(star(X1),multiplication(X1,addition(one,X1))) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_49]),c_0_19]) ).
cnf(c_0_53,negated_conjecture,
~ leq(multiplication(a,a),star(a)),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_54,plain,
leq(multiplication(X1,X1),star(X1)),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : KLE170+1.002 : TPTP v8.1.2. Released v5.2.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n008.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 04:53:12 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.00WXWOotK4/E---3.1_15076.p
% 3.02/0.84 # Version: 3.1pre001
% 3.02/0.84 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.02/0.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.02/0.84 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.02/0.84 # Starting new_bool_3 with 300s (1) cores
% 3.02/0.84 # Starting new_bool_1 with 300s (1) cores
% 3.02/0.84 # Starting sh5l with 300s (1) cores
% 3.02/0.84 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15154 completed with status 0
% 3.02/0.84 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.02/0.84 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.02/0.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.02/0.84 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.02/0.84 # No SInE strategy applied
% 3.02/0.84 # Search class: FHUSM-FFSF21-MFFFFFNN
% 3.02/0.84 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 3.02/0.84 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.02/0.84 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.02/0.84 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 3.02/0.84 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 3.02/0.84 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with 136s (1) cores
% 3.02/0.84 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 15163 completed with status 0
% 3.02/0.84 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 3.02/0.84 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.02/0.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.02/0.84 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.02/0.84 # No SInE strategy applied
% 3.02/0.84 # Search class: FHUSM-FFSF21-MFFFFFNN
% 3.02/0.84 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 3.02/0.84 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.02/0.84 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.02/0.84 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 3.02/0.84 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 3.02/0.84 # Preprocessing time : 0.001 s
% 3.02/0.84 # Presaturation interreduction done
% 3.02/0.84
% 3.02/0.84 # Proof found!
% 3.02/0.84 # SZS status Theorem
% 3.02/0.84 # SZS output start CNFRefutation
% See solution above
% 3.02/0.84 # Parsed axioms : 17
% 3.02/0.84 # Removed by relevancy pruning/SinE : 0
% 3.02/0.84 # Initial clauses : 18
% 3.02/0.84 # Removed in clause preprocessing : 0
% 3.02/0.84 # Initial clauses in saturation : 18
% 3.02/0.84 # Processed clauses : 3952
% 3.02/0.84 # ...of these trivial : 497
% 3.02/0.84 # ...subsumed : 2712
% 3.02/0.84 # ...remaining for further processing : 743
% 3.02/0.84 # Other redundant clauses eliminated : 37
% 3.02/0.84 # Clauses deleted for lack of memory : 0
% 3.02/0.84 # Backward-subsumed : 5
% 3.02/0.84 # Backward-rewritten : 103
% 3.02/0.84 # Generated clauses : 33650
% 3.02/0.84 # ...of the previous two non-redundant : 23923
% 3.02/0.84 # ...aggressively subsumed : 0
% 3.02/0.84 # Contextual simplify-reflections : 0
% 3.02/0.84 # Paramodulations : 33613
% 3.02/0.84 # Factorizations : 0
% 3.02/0.84 # NegExts : 0
% 3.02/0.84 # Equation resolutions : 37
% 3.02/0.84 # Total rewrite steps : 36703
% 3.02/0.84 # Propositional unsat checks : 0
% 3.02/0.84 # Propositional check models : 0
% 3.02/0.84 # Propositional check unsatisfiable : 0
% 3.02/0.84 # Propositional clauses : 0
% 3.02/0.84 # Propositional clauses after purity: 0
% 3.02/0.84 # Propositional unsat core size : 0
% 3.02/0.84 # Propositional preprocessing time : 0.000
% 3.02/0.84 # Propositional encoding time : 0.000
% 3.02/0.84 # Propositional solver time : 0.000
% 3.02/0.84 # Success case prop preproc time : 0.000
% 3.02/0.84 # Success case prop encoding time : 0.000
% 3.02/0.84 # Success case prop solver time : 0.000
% 3.02/0.84 # Current number of processed clauses : 617
% 3.02/0.84 # Positive orientable unit clauses : 256
% 3.02/0.84 # Positive unorientable unit clauses: 7
% 3.02/0.84 # Negative unit clauses : 0
% 3.02/0.84 # Non-unit-clauses : 354
% 3.02/0.84 # Current number of unprocessed clauses: 19820
% 3.02/0.84 # ...number of literals in the above : 33601
% 3.02/0.84 # Current number of archived formulas : 0
% 3.02/0.84 # Current number of archived clauses : 126
% 3.02/0.84 # Clause-clause subsumption calls (NU) : 40826
% 3.02/0.84 # Rec. Clause-clause subsumption calls : 40739
% 3.02/0.84 # Non-unit clause-clause subsumptions : 2618
% 3.02/0.84 # Unit Clause-clause subsumption calls : 1460
% 3.02/0.84 # Rewrite failures with RHS unbound : 0
% 3.02/0.84 # BW rewrite match attempts : 1275
% 3.02/0.84 # BW rewrite match successes : 114
% 3.02/0.84 # Condensation attempts : 0
% 3.02/0.84 # Condensation successes : 0
% 3.02/0.84 # Termbank termtop insertions : 403191
% 3.02/0.84
% 3.02/0.84 # -------------------------------------------------
% 3.02/0.84 # User time : 0.397 s
% 3.02/0.84 # System time : 0.020 s
% 3.02/0.84 # Total time : 0.417 s
% 3.02/0.84 # Maximum resident set size: 1712 pages
% 3.02/0.84
% 3.02/0.84 # -------------------------------------------------
% 3.02/0.84 # User time : 2.003 s
% 3.02/0.84 # System time : 0.076 s
% 3.02/0.84 # Total time : 2.079 s
% 3.02/0.84 # Maximum resident set size: 1688 pages
% 3.02/0.84 % E---3.1 exiting
% 3.02/0.84 % E---3.1 exiting
%------------------------------------------------------------------------------