%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE004+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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.25s 1.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 41 ( 23 unt; 0 def)
% Number of atoms : 82 ( 45 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 76 ( 35 ~; 30 |; 7 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 8 sgn 27 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_1) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
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(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(goals,conjecture,
c(zero) = one,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(right_annihilation,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_annihilation) ).
fof(c_0_9,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_10,plain,
! [X6,X6,X8] :
( ( ~ test(X6)
| complement(esk1_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])])])])])]) ).
fof(c_0_11,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[additive_identity]) ).
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,
! [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_14,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_15,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( complement(esk1_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,negated_conjecture,
c(zero) != one,
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_18,plain,
( test(X1)
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( complement(X1,X2)
| addition(X2,X1) != one
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_22,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_23,plain,
! [X2] : multiplication(X2,zero) = zero,
inference(variable_rename,[status(thm)],[right_annihilation]) ).
cnf(c_0_24,plain,
( c(X1) = X2
| ~ test(X1)
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,plain,
( multiplication(esk1_1(X1),X1) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_27,negated_conjecture,
c(zero) != one,
inference(fof_simplification,[status(thm)],[c_0_17]) ).
cnf(c_0_28,plain,
( test(X1)
| addition(X1,X2) != one
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_29,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( c(esk1_1(X1)) = X1
| ~ test(esk1_1(X1))
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_33,plain,
( esk1_1(one) = zero
| ~ test(one) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,negated_conjecture,
c(zero) != one,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
( test(zero)
| X1 != one ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_36,plain,
( ~ test(zero)
| ~ test(one) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_37,plain,
test(zero),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_38,plain,
~ test(one),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_39,plain,
( test(X1)
| X1 != one ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_20]),c_0_31]),c_0_30])]) ).
cnf(c_0_40,plain,
$false,
inference(spm,[status(thm)],[c_0_38,c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KLE004+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jun 16 09:48:27 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.25/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.44 # Preprocessing time : 0.015 s
% 0.25/1.44
% 0.25/1.44 # Proof found!
% 0.25/1.44 # SZS status Theorem
% 0.25/1.44 # SZS output start CNFRefutation
% See solution above
% 0.25/1.44 # Proof object total steps : 41
% 0.25/1.44 # Proof object clause steps : 22
% 0.25/1.44 # Proof object formula steps : 19
% 0.25/1.44 # Proof object conjectures : 4
% 0.25/1.44 # Proof object clause conjectures : 1
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 11
% 0.25/1.44 # Proof object initial formulas used : 9
% 0.25/1.44 # Proof object generating inferences : 10
% 0.25/1.44 # Proof object simplifying inferences : 9
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 17
% 0.25/1.44 # Removed by relevancy pruning/SinE : 1
% 0.25/1.44 # Initial clauses : 21
% 0.25/1.44 # Removed in clause preprocessing : 0
% 0.25/1.44 # Initial clauses in saturation : 21
% 0.25/1.44 # Processed clauses : 63
% 0.25/1.44 # ...of these trivial : 2
% 0.25/1.44 # ...subsumed : 10
% 0.25/1.44 # ...remaining for further processing : 51
% 0.25/1.44 # Other redundant clauses eliminated : 1
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 3
% 0.25/1.44 # Backward-rewritten : 5
% 0.25/1.44 # Generated clauses : 290
% 0.25/1.44 # ...of the previous two non-trivial : 196
% 0.25/1.44 # Contextual simplify-reflections : 9
% 0.25/1.44 # Paramodulations : 287
% 0.25/1.44 # Factorizations : 0
% 0.25/1.44 # Equation resolutions : 3
% 0.25/1.44 # Current number of processed clauses : 43
% 0.25/1.44 # Positive orientable unit clauses : 17
% 0.25/1.44 # Positive unorientable unit clauses: 3
% 0.25/1.44 # Negative unit clauses : 2
% 0.25/1.44 # Non-unit-clauses : 21
% 0.25/1.44 # Current number of unprocessed clauses: 154
% 0.25/1.44 # ...number of literals in the above : 222
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 8
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 55
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 55
% 0.25/1.44 # Non-unit clause-clause subsumptions : 17
% 0.25/1.44 # Unit Clause-clause subsumption calls : 12
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 25
% 0.25/1.44 # BW rewrite match successes : 23
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 2964
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.017 s
% 0.25/1.44 # System time : 0.003 s
% 0.25/1.44 # Total time : 0.019 s
% 0.25/1.44 # Maximum resident set size: 2816 pages
%------------------------------------------------------------------------------