TSTP Solution File: KLE003+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE003+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 01:55:12 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 4 unt; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 11 ( 5 ~; 3 |; 1 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
( ! [X4] : addition(X4,X4) = X4
<=> addition(one,one) = one ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(c_0_2,negated_conjecture,
~ ( ! [X4] : addition(X4,X4) = X4
<=> addition(one,one) = one ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_3,negated_conjecture,
! [X6] :
( ( addition(esk1_0,esk1_0) != esk1_0
| addition(one,one) != one )
& ( addition(X6,X6) = X6
| addition(one,one) = one ) ),
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)],[c_0_2])])])])])]) ).
fof(c_0_4,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_5,negated_conjecture,
( addition(one,one) != one
| addition(esk1_0,esk1_0) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.11 % Problem : KLE003+1 : TPTP v8.1.0. Released v4.0.0.
% 0.01/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n008.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 : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 16 12:39:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.014 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 8
% 0.22/1.40 # Proof object clause steps : 3
% 0.22/1.40 # Proof object formula steps : 5
% 0.22/1.40 # Proof object conjectures : 5
% 0.22/1.40 # Proof object clause conjectures : 2
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 2
% 0.22/1.40 # Proof object initial formulas used : 2
% 0.22/1.40 # Proof object generating inferences : 0
% 0.22/1.40 # Proof object simplifying inferences : 3
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 13
% 0.22/1.40 # Removed by relevancy pruning/SinE : 4
% 0.22/1.40 # Initial clauses : 10
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 10
% 0.22/1.40 # Processed clauses : 2
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 0
% 0.22/1.40 # ...remaining for further processing : 2
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 1
% 0.22/1.40 # Generated clauses : 0
% 0.22/1.40 # ...of the previous two non-trivial : 0
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 0
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 1
% 0.22/1.40 # Positive orientable unit clauses : 1
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 0
% 0.22/1.40 # Non-unit-clauses : 0
% 0.22/1.40 # Current number of unprocessed clauses: 8
% 0.22/1.40 # ...number of literals in the above : 9
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 1
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 0
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 0
% 0.22/1.40 # Non-unit clause-clause subsumptions : 0
% 0.22/1.40 # Unit Clause-clause subsumption calls : 0
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 2
% 0.22/1.40 # BW rewrite match successes : 2
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 411
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.012 s
% 0.22/1.40 # System time : 0.002 s
% 0.22/1.40 # Total time : 0.015 s
% 0.22/1.40 # Maximum resident set size: 2808 pages
%------------------------------------------------------------------------------