TSTP Solution File: KLE048+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE048+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 01:55:36 EDT 2022
% Result : Theorem 0.20s 1.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 43 ( 23 unt; 0 def)
% Number of atoms : 77 ( 37 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 58 ( 24 ~; 20 |; 8 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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 : 67 ( 5 sgn 40 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',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/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_1) ).
fof(goals,conjecture,
! [X4] :
( test(X4)
=> star(X4) = one ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(star_induction_right,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X2),X3),X1)
=> leq(multiplication(X3,star(X2)),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',star_induction_right) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',multiplicative_left_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',order) ).
fof(star_unfold_right,axiom,
! [X1] : leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',star_unfold_right) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',additive_commutativity) ).
fof(c_0_10,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_11,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_12,plain,
! [X6,X7,X6,X7] :
( ( multiplication(X6,X7) = zero
| ~ complement(X7,X6) )
& ( multiplication(X7,X6) = zero
| ~ complement(X7,X6) )
& ( addition(X6,X7) = one
| ~ complement(X7,X6) )
& ( multiplication(X6,X7) != zero
| multiplication(X7,X6) != zero
| addition(X6,X7) != one
| complement(X7,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])])])]) ).
fof(c_0_13,plain,
! [X6,X6,X8] :
( ( ~ test(X6)
| complement(esk2_1(X6),X6) )
& ( ~ complement(X8,X6)
| test(X6) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_1])])])])])]) ).
cnf(c_0_14,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( addition(X2,X1) = one
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( complement(esk2_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,negated_conjecture,
~ ! [X4] :
( test(X4)
=> star(X4) = one ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_19,plain,
! [X4,X5,X6] :
( ~ leq(addition(multiplication(X4,X5),X6),X4)
| leq(multiplication(X6,star(X5)),X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_right])]) ).
fof(c_0_20,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_21,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
( addition(X1,esk2_1(X1)) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_23,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_18])])]) ).
fof(c_0_24,plain,
! [X3,X4,X3,X4] :
( ( ~ leq(X3,X4)
| addition(X3,X4) = X4 )
& ( addition(X3,X4) != X4
| leq(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])])]) ).
fof(c_0_25,plain,
! [X2] : leq(addition(one,multiplication(X2,star(X2))),star(X2)),
inference(variable_rename,[status(thm)],[star_unfold_right]) ).
fof(c_0_26,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_27,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
( addition(X1,one) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,negated_conjecture,
test(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
( leq(multiplication(X1,star(X2)),one)
| ~ leq(addition(X2,X1),one) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
addition(esk1_0,one) = one,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,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_31,c_0_32]),c_0_14]),c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( leq(star(esk1_0),one)
| ~ leq(one,one) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_28]) ).
cnf(c_0_38,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_21,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
star(esk1_0) != one,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_40,negated_conjecture,
~ leq(one,one),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_37]),c_0_33]),c_0_38]),c_0_39]) ).
cnf(c_0_41,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : KLE048+1 : TPTP v8.1.0. Released v4.0.0.
% 0.09/0.11 % Command : run_ET %s %d
% 0.10/0.31 % Computer : n014.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Thu Jun 16 12:21:05 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.20/1.38 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.20/1.38 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.20/1.38 # Preprocessing time : 0.013 s
% 0.20/1.38
% 0.20/1.38 # Proof found!
% 0.20/1.38 # SZS status Theorem
% 0.20/1.38 # SZS output start CNFRefutation
% See solution above
% 0.20/1.38 # Proof object total steps : 43
% 0.20/1.38 # Proof object clause steps : 22
% 0.20/1.38 # Proof object formula steps : 21
% 0.20/1.38 # Proof object conjectures : 9
% 0.20/1.38 # Proof object clause conjectures : 6
% 0.20/1.38 # Proof object formula conjectures : 3
% 0.20/1.38 # Proof object initial clauses used : 12
% 0.20/1.38 # Proof object initial formulas used : 10
% 0.20/1.38 # Proof object generating inferences : 10
% 0.20/1.38 # Proof object simplifying inferences : 8
% 0.20/1.38 # Training examples: 0 positive, 0 negative
% 0.20/1.38 # Parsed axioms : 21
% 0.20/1.38 # Removed by relevancy pruning/SinE : 2
% 0.20/1.38 # Initial clauses : 25
% 0.20/1.38 # Removed in clause preprocessing : 0
% 0.20/1.38 # Initial clauses in saturation : 25
% 0.20/1.38 # Processed clauses : 128
% 0.20/1.38 # ...of these trivial : 17
% 0.20/1.38 # ...subsumed : 30
% 0.20/1.38 # ...remaining for further processing : 81
% 0.20/1.38 # Other redundant clauses eliminated : 0
% 0.20/1.38 # Clauses deleted for lack of memory : 0
% 0.20/1.38 # Backward-subsumed : 1
% 0.20/1.38 # Backward-rewritten : 15
% 0.20/1.38 # Generated clauses : 750
% 0.20/1.38 # ...of the previous two non-trivial : 547
% 0.20/1.38 # Contextual simplify-reflections : 5
% 0.20/1.38 # Paramodulations : 749
% 0.20/1.38 # Factorizations : 0
% 0.20/1.38 # Equation resolutions : 1
% 0.20/1.38 # Current number of processed clauses : 65
% 0.20/1.38 # Positive orientable unit clauses : 33
% 0.20/1.38 # Positive unorientable unit clauses: 5
% 0.20/1.38 # Negative unit clauses : 2
% 0.20/1.38 # Non-unit-clauses : 25
% 0.20/1.38 # Current number of unprocessed clauses: 424
% 0.20/1.38 # ...number of literals in the above : 703
% 0.20/1.38 # Current number of archived formulas : 0
% 0.20/1.38 # Current number of archived clauses : 16
% 0.20/1.38 # Clause-clause subsumption calls (NU) : 124
% 0.20/1.38 # Rec. Clause-clause subsumption calls : 110
% 0.20/1.38 # Non-unit clause-clause subsumptions : 23
% 0.20/1.38 # Unit Clause-clause subsumption calls : 9
% 0.20/1.38 # Rewrite failures with RHS unbound : 0
% 0.20/1.38 # BW rewrite match attempts : 60
% 0.20/1.38 # BW rewrite match successes : 41
% 0.20/1.38 # Condensation attempts : 0
% 0.20/1.38 # Condensation successes : 0
% 0.20/1.38 # Termbank termtop insertions : 7976
% 0.20/1.38
% 0.20/1.38 # -------------------------------------------------
% 0.20/1.38 # User time : 0.023 s
% 0.20/1.38 # System time : 0.001 s
% 0.20/1.38 # Total time : 0.024 s
% 0.20/1.38 # Maximum resident set size: 3348 pages
% 0.20/23.38 eprover: CPU time limit exceeded, terminating
% 0.20/23.39 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.39 eprover: No such file or directory
% 0.20/23.39 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.39 eprover: No such file or directory
% 0.20/23.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.40 eprover: No such file or directory
% 0.20/23.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.40 eprover: No such file or directory
% 0.20/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.41 eprover: No such file or directory
% 0.20/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.41 eprover: No such file or directory
% 0.20/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.42 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.44 eprover: No such file or directory
% 0.20/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.20/23.44 eprover: No such file or directory
%------------------------------------------------------------------------------