%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE009+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:14 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 21 unt; 0 def)
% Number of atoms : 62 ( 36 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 52 ( 22 ~; 15 |; 10 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 51 ( 3 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] :
( ( test(X5)
& test(X4) )
=> one = addition(addition(addition(multiplication(X4,X5),multiplication(X4,c(X5))),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
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(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(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(c_0_7,negated_conjecture,
~ ! [X4,X5] :
( ( test(X5)
& test(X4) )
=> one = addition(addition(addition(multiplication(X4,X5),multiplication(X4,c(X5))),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_8,negated_conjecture,
( test(esk2_0)
& test(esk1_0)
& one != addition(addition(addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))),multiplication(c(esk1_0),esk2_0)),multiplication(c(esk1_0),c(esk2_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_9,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_10,plain,
! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_11,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_12,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])])])])]) ).
cnf(c_0_13,negated_conjecture,
one != addition(addition(addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))),multiplication(c(esk1_0),esk2_0)),multiplication(c(esk1_0),c(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,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_18,plain,
( complement(X1,X2)
| ~ test(X1)
| c(X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
addition(multiplication(c(esk1_0),c(esk2_0)),addition(multiplication(c(esk1_0),esk2_0),multiplication(esk1_0,addition(esk2_0,c(esk2_0))))) != one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14]),c_0_15]) ).
cnf(c_0_20,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_16]) ).
cnf(c_0_21,plain,
( addition(X2,X1) = one
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_18]) ).
fof(c_0_23,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_24,negated_conjecture,
addition(multiplication(c(esk1_0),esk2_0),addition(multiplication(c(esk1_0),c(esk2_0)),multiplication(esk1_0,addition(esk2_0,c(esk2_0))))) != one,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_14]) ).
cnf(c_0_26,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,negated_conjecture,
addition(esk1_0,multiplication(c(esk1_0),addition(esk2_0,c(esk2_0)))) != one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]),c_0_14]),c_0_20]),c_0_15]) ).
cnf(c_0_29,negated_conjecture,
addition(esk1_0,c(esk1_0)) != one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_30,negated_conjecture,
test(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_25]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE009+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 08:25:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.017 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 32
% 0.24/1.42 # Proof object clause steps : 17
% 0.24/1.42 # Proof object formula steps : 15
% 0.24/1.42 # Proof object conjectures : 11
% 0.24/1.42 # Proof object clause conjectures : 8
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 9
% 0.24/1.42 # Proof object initial formulas used : 7
% 0.24/1.42 # Proof object generating inferences : 6
% 0.24/1.42 # Proof object simplifying inferences : 17
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 17
% 0.24/1.42 # Removed by relevancy pruning/SinE : 1
% 0.24/1.42 # Initial clauses : 23
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 23
% 0.24/1.42 # Processed clauses : 231
% 0.24/1.42 # ...of these trivial : 41
% 0.24/1.42 # ...subsumed : 51
% 0.24/1.42 # ...remaining for further processing : 139
% 0.24/1.42 # Other redundant clauses eliminated : 1
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 4
% 0.24/1.42 # Backward-rewritten : 9
% 0.24/1.42 # Generated clauses : 1676
% 0.24/1.42 # ...of the previous two non-trivial : 1155
% 0.24/1.42 # Contextual simplify-reflections : 31
% 0.24/1.42 # Paramodulations : 1671
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 5
% 0.24/1.42 # Current number of processed clauses : 126
% 0.24/1.42 # Positive orientable unit clauses : 61
% 0.24/1.42 # Positive unorientable unit clauses: 7
% 0.24/1.42 # Negative unit clauses : 7
% 0.24/1.42 # Non-unit-clauses : 51
% 0.24/1.42 # Current number of unprocessed clauses: 941
% 0.24/1.42 # ...number of literals in the above : 1359
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 13
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 265
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 244
% 0.24/1.42 # Non-unit clause-clause subsumptions : 56
% 0.24/1.42 # Unit Clause-clause subsumption calls : 84
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 150
% 0.24/1.42 # BW rewrite match successes : 34
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 18170
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.042 s
% 0.24/1.42 # System time : 0.004 s
% 0.24/1.42 # Total time : 0.046 s
% 0.24/1.42 # Maximum resident set size: 4136 pages
%------------------------------------------------------------------------------