%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE093+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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:50 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 35 ( 32 unt; 0 def)
% Number of atoms : 40 ( 32 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 11 ( 6 ~; 3 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 48 ( 7 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(domain1,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain1) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',multiplicative_right_identity) ).
fof(domain3,axiom,
! [X4] : addition(domain(X4),one) = one,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain3) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',additive_commutativity) ).
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_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(domain5,axiom,
! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain5) ).
fof(goals,conjecture,
! [X4] : domain(star(X4)) = one,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(c_0_9,plain,
! [X5] : addition(X5,multiplication(domain(X5),X5)) = multiplication(domain(X5),X5),
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_10,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_11,plain,
! [X5] : addition(domain(X5),one) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_12,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_13,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_14,plain,
! [X2] : leq(addition(one,multiplication(X2,star(X2))),star(X2)),
inference(variable_rename,[status(thm)],[star_unfold_right]) ).
fof(c_0_15,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
cnf(c_0_16,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
addition(domain(X1),one) = one,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_20,plain,
! [X6,X7] : domain(addition(X6,X7)) = addition(domain(X6),domain(X7)),
inference(variable_rename,[status(thm)],[domain5]) ).
fof(c_0_21,negated_conjecture,
~ ! [X4] : domain(star(X4)) = one,
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_22,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
addition(one,domain(one)) = domain(one),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_26,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_28,negated_conjecture,
domain(star(esk1_0)) != one,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
cnf(c_0_29,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_22,c_0_23]),c_0_24]),c_0_19]) ).
cnf(c_0_30,plain,
domain(one) = one,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
addition(one,addition(domain(X1),domain(X2))) = one,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
domain(star(esk1_0)) != one,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
domain(star(X1)) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_29]),c_0_30]),c_0_27]),c_0_31]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KLE093+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n019.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:57:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.015 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 35
% 0.21/1.40 # Proof object clause steps : 16
% 0.21/1.40 # Proof object formula steps : 19
% 0.21/1.40 # Proof object conjectures : 5
% 0.21/1.40 # Proof object clause conjectures : 2
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 9
% 0.21/1.40 # Proof object initial formulas used : 9
% 0.21/1.40 # Proof object generating inferences : 4
% 0.21/1.40 # Proof object simplifying inferences : 9
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 22
% 0.21/1.40 # Removed by relevancy pruning/SinE : 4
% 0.21/1.40 # Initial clauses : 19
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 19
% 0.21/1.40 # Processed clauses : 47
% 0.21/1.40 # ...of these trivial : 6
% 0.21/1.40 # ...subsumed : 2
% 0.21/1.40 # ...remaining for further processing : 39
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 0
% 0.21/1.40 # Backward-rewritten : 5
% 0.21/1.40 # Generated clauses : 327
% 0.21/1.40 # ...of the previous two non-trivial : 215
% 0.21/1.40 # Contextual simplify-reflections : 0
% 0.21/1.40 # Paramodulations : 327
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 34
% 0.21/1.40 # Positive orientable unit clauses : 27
% 0.21/1.40 # Positive unorientable unit clauses: 3
% 0.21/1.40 # Negative unit clauses : 0
% 0.21/1.40 # Non-unit-clauses : 4
% 0.21/1.40 # Current number of unprocessed clauses: 182
% 0.21/1.40 # ...number of literals in the above : 214
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 5
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 4
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 4
% 0.21/1.40 # Non-unit clause-clause subsumptions : 0
% 0.21/1.40 # Unit Clause-clause subsumption calls : 1
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 32
% 0.21/1.40 # BW rewrite match successes : 22
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 3834
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.020 s
% 0.21/1.40 # System time : 0.000 s
% 0.21/1.40 # Total time : 0.020 s
% 0.21/1.40 # Maximum resident set size: 3084 pages
%------------------------------------------------------------------------------