TSTP Solution File: KLE021+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE021+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n011.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:22 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 15 unt; 0 def)
% Number of atoms : 68 ( 31 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 63 ( 26 ~; 21 |; 10 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 5 sgn 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] :
( test(X5)
=> ( leq(X4,addition(multiplication(X5,X4),multiplication(c(X5),X4)))
& leq(addition(multiplication(X5,X4),multiplication(c(X5),X4)),X4) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
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/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(c_0_8,negated_conjecture,
~ ! [X4,X5] :
( test(X5)
=> ( leq(X4,addition(multiplication(X5,X4),multiplication(c(X5),X4)))
& leq(addition(multiplication(X5,X4),multiplication(c(X5),X4)),X4) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_9,plain,
! [X6,X7,X7] :
( ( c(X6) != X7
| complement(X6,X7)
| ~ test(X6) )
& ( ~ complement(X6,X7)
| c(X6) = X7
| ~ test(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_3])])])])]) ).
fof(c_0_10,negated_conjecture,
( test(esk2_0)
& ( ~ leq(esk1_0,addition(multiplication(esk2_0,esk1_0),multiplication(c(esk2_0),esk1_0)))
| ~ leq(addition(multiplication(esk2_0,esk1_0),multiplication(c(esk2_0),esk1_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,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
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])])])])]) ).
cnf(c_0_13,plain,
( complement(X1,X2)
| ~ test(X1)
| c(X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_15,negated_conjecture,
( ~ leq(addition(multiplication(esk2_0,esk1_0),multiplication(c(esk2_0),esk1_0)),esk1_0)
| ~ leq(esk1_0,addition(multiplication(esk2_0,esk1_0),multiplication(c(esk2_0),esk1_0))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( addition(X2,X1) = one
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_20,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_21,negated_conjecture,
( ~ leq(esk1_0,multiplication(addition(esk2_0,c(esk2_0)),esk1_0))
| ~ leq(multiplication(addition(esk2_0,c(esk2_0)),esk1_0),esk1_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_22,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_25,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_26,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_27,negated_conjecture,
~ leq(esk1_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_23]),c_0_24])]) ).
cnf(c_0_28,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KLE021+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n011.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 16 12:46:06 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.017 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 31
% 0.24/1.41 # Proof object clause steps : 14
% 0.24/1.41 # Proof object formula steps : 17
% 0.24/1.41 # Proof object conjectures : 8
% 0.24/1.41 # Proof object clause conjectures : 5
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 9
% 0.24/1.41 # Proof object initial formulas used : 8
% 0.24/1.41 # Proof object generating inferences : 4
% 0.24/1.41 # Proof object simplifying inferences : 9
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 17
% 0.24/1.41 # Removed by relevancy pruning/SinE : 0
% 0.24/1.41 # Initial clauses : 24
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 24
% 0.24/1.41 # Processed clauses : 276
% 0.24/1.41 # ...of these trivial : 42
% 0.24/1.41 # ...subsumed : 94
% 0.24/1.41 # ...remaining for further processing : 140
% 0.24/1.41 # Other redundant clauses eliminated : 1
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 1
% 0.24/1.41 # Backward-rewritten : 12
% 0.24/1.41 # Generated clauses : 2284
% 0.24/1.41 # ...of the previous two non-trivial : 1648
% 0.24/1.41 # Contextual simplify-reflections : 49
% 0.24/1.41 # Paramodulations : 2280
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 4
% 0.24/1.41 # Current number of processed clauses : 127
% 0.24/1.41 # Positive orientable unit clauses : 53
% 0.24/1.41 # Positive unorientable unit clauses: 7
% 0.24/1.41 # Negative unit clauses : 2
% 0.24/1.41 # Non-unit-clauses : 65
% 0.24/1.41 # Current number of unprocessed clauses: 1221
% 0.24/1.41 # ...number of literals in the above : 2348
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 13
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 1086
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 1011
% 0.24/1.41 # Non-unit clause-clause subsumptions : 116
% 0.24/1.41 # Unit Clause-clause subsumption calls : 25
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 207
% 0.24/1.41 # BW rewrite match successes : 35
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 31328
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.062 s
% 0.24/1.41 # System time : 0.002 s
% 0.24/1.41 # Total time : 0.064 s
% 0.24/1.41 # Maximum resident set size: 4400 pages
% 0.24/23.41 eprover: CPU time limit exceeded, terminating
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------