%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE024+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n014.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:25 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 18 unt; 0 def)
% Number of atoms : 67 ( 42 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 60 ( 23 ~; 19 |; 11 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 52 ( 5 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] :
( ( test(X5)
& test(X6) )
=> ( addition(multiplication(X4,c(X6)),multiplication(c(X5),X4)) = multiplication(c(X5),X4)
=> multiplication(multiplication(X5,X4),c(X6)) = zero ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(c_0_7,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X5)
& test(X6) )
=> ( addition(multiplication(X4,c(X6)),multiplication(c(X5),X4)) = multiplication(c(X5),X4)
=> multiplication(multiplication(X5,X4),c(X6)) = zero ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_8,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_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,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,negated_conjecture,
( test(esk3_0)
& test(esk4_0)
& addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0)) = multiplication(c(esk3_0),esk2_0)
& multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)) != zero ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_12,plain,
! [X4,X5,X6] : multiplication(X4,multiplication(X5,X6)) = multiplication(multiplication(X4,X5),X6),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_13,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( complement(X1,X2)
| ~ test(X1)
| c(X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_16,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0)) = multiplication(c(esk3_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( multiplication(X1,X2) = zero
| c(X1) != X2
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_22,negated_conjecture,
multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)) != zero,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
addition(multiplication(X1,multiplication(esk2_0,c(esk4_0))),multiplication(X1,multiplication(c(esk3_0),esk2_0))) = multiplication(X1,multiplication(c(esk3_0),esk2_0)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
( multiplication(X1,multiplication(X2,X3)) = zero
| c(X1) != X2
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_25,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,c(esk4_0))) != zero,
inference(rw,[status(thm)],[c_0_22,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( multiplication(X1,multiplication(esk2_0,c(esk4_0))) = zero
| c(X1) != c(esk3_0)
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_28,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE024+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n014.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 08:07:50 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.22/1.41 # Preprocessing time : 0.015 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 30
% 0.22/1.41 # Proof object clause steps : 15
% 0.22/1.41 # Proof object formula steps : 15
% 0.22/1.41 # Proof object conjectures : 10
% 0.22/1.41 # Proof object clause conjectures : 7
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 9
% 0.22/1.41 # Proof object initial formulas used : 7
% 0.22/1.41 # Proof object generating inferences : 5
% 0.22/1.41 # Proof object simplifying inferences : 5
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 17
% 0.22/1.41 # Removed by relevancy pruning/SinE : 0
% 0.22/1.41 # Initial clauses : 26
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 26
% 0.22/1.41 # Processed clauses : 4005
% 0.22/1.41 # ...of these trivial : 246
% 0.22/1.41 # ...subsumed : 2987
% 0.22/1.41 # ...remaining for further processing : 772
% 0.22/1.41 # Other redundant clauses eliminated : 6
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 92
% 0.22/1.41 # Backward-rewritten : 23
% 0.22/1.41 # Generated clauses : 70357
% 0.22/1.41 # ...of the previous two non-trivial : 54198
% 0.22/1.41 # Contextual simplify-reflections : 3016
% 0.22/1.41 # Paramodulations : 70308
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 28
% 0.22/1.41 # Current number of processed clauses : 649
% 0.22/1.41 # Positive orientable unit clauses : 46
% 0.22/1.41 # Positive unorientable unit clauses: 10
% 0.22/1.41 # Negative unit clauses : 14
% 0.22/1.41 # Non-unit-clauses : 579
% 0.22/1.41 # Current number of unprocessed clauses: 46508
% 0.22/1.41 # ...number of literals in the above : 185488
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 115
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 384036
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 206386
% 0.22/1.41 # Non-unit clause-clause subsumptions : 5163
% 0.22/1.41 # Unit Clause-clause subsumption calls : 1670
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 338
% 0.22/1.41 # BW rewrite match successes : 110
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 1517392
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.720 s
% 0.22/1.41 # System time : 0.029 s
% 0.22/1.41 # Total time : 0.749 s
% 0.22/1.41 # Maximum resident set size: 43472 pages
%------------------------------------------------------------------------------