TSTP Solution File: KLE048+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE048+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:01 EDT 2023
% Result : Timeout 0.45s 300.16s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 60 ( 40 unt; 0 def)
% Number of atoms : 98 ( 52 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 64 ( 26 ~; 23 |; 8 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 85 ( 0 sgn; 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XPq8Dq2MPw/E---3.1_21981.p',test_3) ).
fof(goals,conjecture,
! [X4] :
( test(X4)
=> star(X4) = one ),
file('/export/starexec/sandbox2/tmp/tmp.XPq8Dq2MPw/E---3.1_21981.p',goals) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.XPq8Dq2MPw/E---3.1_21981.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.XPq8Dq2MPw/E---3.1_21981.p',additive_idempotence) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox2/tmp/tmp.XPq8Dq2MPw/E---3.1_21981.p',test_2) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.XPq8Dq2MPw/E---3.1_21981.p',additive_commutativity) ).
fof(star_induction_right,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X2),X3),X1)
=> leq(multiplication(X3,star(X2)),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.XPq8Dq2MPw/E---3.1_21981.p',star_induction_right) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.XPq8Dq2MPw/E---3.1_21981.p',multiplicative_left_identity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.XPq8Dq2MPw/E---3.1_21981.p',additive_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.XPq8Dq2MPw/E---3.1_21981.p',order) ).
fof(star_unfold_right,axiom,
! [X1] : leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox2/tmp/tmp.XPq8Dq2MPw/E---3.1_21981.p',star_unfold_right) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.XPq8Dq2MPw/E---3.1_21981.p',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.XPq8Dq2MPw/E---3.1_21981.p',multiplicative_right_identity) ).
fof(c_0_13,plain,
! [X23,X24] :
( ( c(X23) != X24
| complement(X23,X24)
| ~ test(X23) )
& ( ~ complement(X23,X24)
| c(X23) = X24
| ~ test(X23) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
fof(c_0_14,negated_conjecture,
~ ! [X4] :
( test(X4)
=> star(X4) = one ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_15,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,negated_conjecture,
( test(esk1_0)
& star(esk1_0) != one ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
fof(c_0_17,plain,
! [X41,X42,X43] : addition(X43,addition(X42,X41)) = addition(addition(X43,X42),X41),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_18,plain,
! [X45] : addition(X45,X45) = X45,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_19,plain,
! [X11,X12] :
( ( multiplication(X11,X12) = zero
| ~ complement(X12,X11) )
& ( multiplication(X12,X11) = zero
| ~ complement(X12,X11) )
& ( addition(X11,X12) = one
| ~ complement(X12,X11) )
& ( multiplication(X11,X12) != zero
| multiplication(X12,X11) != zero
| addition(X11,X12) != one
| complement(X12,X11) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
cnf(c_0_20,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
test(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X39,X40] : addition(X39,X40) = addition(X40,X39),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_23,plain,
! [X16,X17,X18] :
( ~ leq(addition(multiplication(X16,X17),X18),X16)
| leq(multiplication(X18,star(X17)),X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_right])]) ).
fof(c_0_24,plain,
! [X8] : multiplication(one,X8) = X8,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_25,plain,
! [X44] : addition(X44,zero) = X44,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_26,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
complement(esk1_0,c(esk1_0)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
( leq(multiplication(X3,star(X2)),X1)
| ~ leq(addition(multiplication(X1,X2),X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_34,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_35,plain,
! [X9] : leq(addition(one,multiplication(X9,star(X9))),star(X9)),
inference(variable_rename,[status(thm)],[star_unfold_right]) ).
fof(c_0_36,plain,
! [X29,X30,X31] : multiplication(X29,addition(X30,X31)) = addition(multiplication(X29,X30),multiplication(X29,X31)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_37,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_38,negated_conjecture,
addition(esk1_0,c(esk1_0)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
fof(c_0_39,plain,
! [X7] : multiplication(X7,one) = X7,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_40,plain,
( leq(multiplication(X1,star(X2)),one)
| ~ leq(addition(X2,X1),one) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_41,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_30]) ).
cnf(c_0_42,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_44,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_46,negated_conjecture,
addition(one,esk1_0) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_30]) ).
cnf(c_0_47,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_48,plain,
( leq(multiplication(X1,star(zero)),one)
| ~ leq(X1,one) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_49,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_42,c_0_27]) ).
cnf(c_0_50,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_43,c_0_44]),c_0_26]),c_0_30]) ).
cnf(c_0_51,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(X1,multiplication(X3,X2)),X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_52,negated_conjecture,
addition(X1,multiplication(X1,esk1_0)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_47]) ).
cnf(c_0_53,plain,
leq(star(zero),one),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_32]) ).
cnf(c_0_54,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_37,c_0_50]) ).
cnf(c_0_55,negated_conjecture,
leq(multiplication(X1,star(esk1_0)),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_49])]) ).
cnf(c_0_56,plain,
star(zero) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_53]),c_0_30]),c_0_54]) ).
cnf(c_0_57,negated_conjecture,
leq(star(esk1_0),one),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_55]),c_0_32]),c_0_56]),c_0_47]) ).
cnf(c_0_58,negated_conjecture,
star(esk1_0) != one,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_57]),c_0_30]),c_0_54]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : KLE048+1 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n032.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Oct 3 04:51:20 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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.XPq8Dq2MPw/E---3.1_21981.p
% 0.45/300.16 # Version: 3.1pre001
% 0.45/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.45/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.45/300.16 # Starting new_bool_3 with 300s (1) cores
% 0.45/300.16 # Starting new_bool_1 with 300s (1) cores
% 0.45/300.16 # Starting sh5l with 300s (1) cores
% 0.45/300.16 # sh5l with pid 22127 completed with status 0
% 0.45/300.16 # Result found by sh5l
% 0.45/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.45/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.45/300.16 # Starting new_bool_3 with 300s (1) cores
% 0.45/300.16 # Starting new_bool_1 with 300s (1) cores
% 0.45/300.16 # Starting sh5l with 300s (1) cores
% 0.45/300.16 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.45/300.16 # Search class: FGUSM-FFMF21-MFFFFFNN
% 0.45/300.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.45/300.16 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 181s (1) cores
% 0.45/300.16 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 22134 completed with status 0
% 0.45/300.16 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.45/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.45/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.45/300.16 # Starting new_bool_3 with 300s (1) cores
% 0.45/300.16 # Starting new_bool_1 with 300s (1) cores
% 0.45/300.16 # Starting sh5l with 300s (1) cores
% 0.45/300.16 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.45/300.16 # Search class: FGUSM-FFMF21-MFFFFFNN
% 0.45/300.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.45/300.16 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 181s (1) cores
% 0.45/300.16 # Preprocessing time : 0.001 s
% 0.45/300.16
% 0.45/300.16 # Proof found!
% 0.45/300.16 # SZS status Theorem
% 0.45/300.16 # SZS output start CNFRefutation
% See solution above
% 0.45/300.16 # Parsed axioms : 21
% 0.45/300.16 # Removed by relevancy pruning/SinE : 0
% 0.45/300.16 # Initial clauses : 28
% 0.45/300.16 # Removed in clause preprocessing : 0
% 0.45/300.16 # Initial clauses in saturation : 28
% 0.45/300.16 # Processed clauses : 361
% 0.45/300.16 # ...of these trivial : 33
% 0.45/300.16 # ...subsumed : 132
% 0.45/300.16 # ...remaining for further processing : 195
% 0.45/300.16 # Other redundant clauses eliminated : 25
% 0.45/300.16 # Clauses deleted for lack of memory : 0
% 0.45/300.16 # Backward-subsumed : 10
% 0.45/300.16 # Backward-rewritten : 29
% 0.45/300.16 # Generated clauses : 1666
% 0.45/300.16 # ...of the previous two non-redundant : 1184
% 0.45/300.16 # ...aggressively subsumed : 0
% 0.45/300.16 # Contextual simplify-reflections : 0
% 0.45/300.16 # Paramodulations : 1641
% 0.45/300.16 # Factorizations : 0
% 0.45/300.16 # NegExts : 0
% 0.45/300.16 # Equation resolutions : 25
% 0.45/300.16 # Total rewrite steps : 1979
% 0.45/300.16 # Propositional unsat checks : 0
% 0.45/300.16 # Propositional check models : 0
% 0.45/300.16 # Propositional check unsatisfiable : 0
% 0.45/300.16 # Propositional clauses : 0
% 0.45/300.16 # Propositional clauses after purity: 0
% 0.45/300.16 # Propositional unsat core size : 0
% 0.45/300.16 # Propositional preprocessing time : 0.000
% 0.45/300.16 # Propositional encoding time : 0.000
% 0.45/300.16 # Propositional solver time : 0.000
% 0.45/300.16 # Success case prop preproc time : 0.000
% 0.45/300.16 # Success case prop encoding time : 0.000
% 0.45/300.16 # Success case prop solver time : 0.000
% 0.45/300.16 # Current number of processed clauses : 155
% 0.45/300.16 # Positive orientable unit clauses : 74
% 0.45/300.16 # Positive unorientable unit clauses: 3
% 0.45/300.16 # Negative unit clauses : 1
% 0.45/300.16 # Non-unit-clauses : 77
% 0.45/300.16 # Current number of unprocessed clauses: 832
% 0.45/300.16 # ...number of literals in the above : 1303
% 0.45/300.16 # Current number of archived formulas : 0
% 0.45/300.16 # Current number of archived clauses : 39
% 0.45/300.16 # Clause-clause subsumption calls (NU) : 1749
% 0.45/300.16 # Rec. Clause-clause subsumption calls : 1108
% 0.45/300.16 # Non-unit clause-clause subsumptions : 140
% 0.45/300.16 # Unit Clause-clause subsumption calls : 216
% 0.45/300.16 # Rewrite failures with RHS unbound : 0
% 0.45/300.16 # BW rewrite match attempts : 92
% 0.45/300.16 # BW rewrite match successes : 45
% 0.45/300.16 # Condensation attempts : 0
% 0.45/300.16 # Condensation successes : 0
% 0.45/300.16 # Termbank termtop insertions : 19524
% 0.45/300.16
% 0.45/300.16 # -------------------------------------------------
% 0.45/300.16 # User time : 0.024 s
% 0.45/300.16 # System time : 0.003 s
% 0.45/300.16 # Total time : 0.027 s
% 0.45/300.16 # Maximum resident set size: 1728 pages
% 0.45/300.16
% 0.45/300.16 # -------------------------------------------------
% 0.45/300.16 # User time : 0.024 s
% 0.45/300.16 # System time : 0.006 s
% 0.45/300.16 # Total time : 0.031 s
% 0.45/300.16 # Maximum resident set size: 1692 pages
% 0.45/300.16 % E---3.1 exiting
% 0.45/300.16 % E---3.1 exiting
%------------------------------------------------------------------------------