TSTP Solution File: KLE080+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE080+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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:45 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 60 ( 57 unt; 0 def)
% Number of atoms : 66 ( 65 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 9 ( 3 ~; 0 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 86 ( 4 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/KLE001+0.ax',additive_commutativity) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(goals,conjecture,
! [X4] :
( ! [X5] :
( addition(domain(X5),antidomain(X5)) = one
& multiplication(domain(X5),antidomain(X5)) = zero )
=> antidomain(antidomain(X4)) = domain(X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(domain2,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain2) ).
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/KLE001+0.ax',multiplicative_right_identity) ).
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(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(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(domain4,axiom,
domain(zero) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain4) ).
fof(c_0_13,plain,
! [X5] : addition(domain(X5),one) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_14,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_15,plain,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
fof(c_0_16,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_17,negated_conjecture,
~ ! [X4] :
( ! [X5] :
( addition(domain(X5),antidomain(X5)) = one
& multiplication(domain(X5),antidomain(X5)) = zero )
=> antidomain(antidomain(X4)) = domain(X4) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_18,plain,
! [X6,X7] : domain(multiplication(X6,X7)) = domain(multiplication(X6,domain(X7))),
inference(variable_rename,[status(thm)],[domain2]) ).
fof(c_0_19,plain,
! [X5] : addition(X5,multiplication(domain(X5),X5)) = multiplication(domain(X5),X5),
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_20,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_21,plain,
addition(domain(X1),one) = one,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_25,plain,
! [X6,X7] : domain(addition(X6,X7)) = addition(domain(X6),domain(X7)),
inference(variable_rename,[status(thm)],[domain5]) ).
fof(c_0_26,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_27,negated_conjecture,
! [X7,X7] :
( addition(domain(X7),antidomain(X7)) = one
& multiplication(domain(X7),antidomain(X7)) = zero
& antidomain(antidomain(esk1_0)) != domain(esk1_0) ),
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_17])])])])])]) ).
fof(c_0_28,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_29,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_31,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_33,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(one,X2),X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_34,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,negated_conjecture,
multiplication(domain(X1),antidomain(X1)) = zero,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,negated_conjecture,
addition(domain(X1),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,plain,
domain(domain(X1)) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_24]),c_0_24]) ).
cnf(c_0_40,plain,
domain(one) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_41,plain,
multiplication(domain(X1),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_33]),c_0_32]),c_0_24]) ).
fof(c_0_42,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_43,plain,
domain(multiplication(X1,addition(X2,X3))) = addition(domain(multiplication(X1,X2)),domain(multiplication(X1,X3))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_44,negated_conjecture,
multiplication(addition(X1,domain(X2)),antidomain(X2)) = multiplication(X1,antidomain(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_36]),c_0_37]) ).
cnf(c_0_45,negated_conjecture,
addition(domain(X1),domain(antidomain(X1))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_38]),c_0_39]),c_0_40]) ).
cnf(c_0_46,plain,
multiplication(domain(multiplication(X1,X2)),multiplication(X1,domain(X2))) = multiplication(X1,domain(X2)),
inference(spm,[status(thm)],[c_0_41,c_0_29]) ).
cnf(c_0_47,plain,
domain(zero) = zero,
inference(split_conjunct,[status(thm)],[domain4]) ).
cnf(c_0_48,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_49,negated_conjecture,
addition(domain(multiplication(X1,X2)),domain(multiplication(X1,antidomain(X2)))) = domain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_38]),c_0_31]),c_0_29]) ).
cnf(c_0_50,negated_conjecture,
multiplication(domain(X1),antidomain(antidomain(X1))) = antidomain(antidomain(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_24]) ).
cnf(c_0_51,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_37,c_0_22]) ).
cnf(c_0_52,negated_conjecture,
multiplication(domain(X1),domain(antidomain(X1))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_36]),c_0_47]),c_0_48]) ).
cnf(c_0_53,negated_conjecture,
domain(antidomain(antidomain(X1))) = domain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_36]),c_0_47]),c_0_51]),c_0_39]) ).
cnf(c_0_54,plain,
addition(X1,multiplication(domain(X1),X2)) = multiplication(domain(X1),addition(X1,X2)),
inference(spm,[status(thm)],[c_0_35,c_0_41]) ).
cnf(c_0_55,negated_conjecture,
multiplication(domain(antidomain(X1)),domain(X1)) = zero,
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
domain(antidomain(X1)) = antidomain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_37]),c_0_22]),c_0_38]),c_0_31]) ).
cnf(c_0_57,negated_conjecture,
antidomain(antidomain(esk1_0)) != domain(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_58,negated_conjecture,
antidomain(antidomain(X1)) = domain(X1),
inference(rw,[status(thm)],[c_0_53,c_0_56]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE080+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n027.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 10:08:50 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.015 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 : 60
% 0.24/1.42 # Proof object clause steps : 34
% 0.24/1.42 # Proof object formula steps : 26
% 0.24/1.42 # Proof object conjectures : 16
% 0.24/1.42 # Proof object clause conjectures : 13
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 15
% 0.24/1.42 # Proof object initial formulas used : 13
% 0.24/1.42 # Proof object generating inferences : 16
% 0.24/1.42 # Proof object simplifying inferences : 24
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 18
% 0.24/1.42 # Removed by relevancy pruning/SinE : 1
% 0.24/1.42 # Initial clauses : 19
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 19
% 0.24/1.42 # Processed clauses : 1154
% 0.24/1.42 # ...of these trivial : 320
% 0.24/1.42 # ...subsumed : 575
% 0.24/1.42 # ...remaining for further processing : 259
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 87
% 0.24/1.42 # Generated clauses : 25211
% 0.24/1.42 # ...of the previous two non-trivial : 16354
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 25211
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 172
% 0.24/1.42 # Positive orientable unit clauses : 132
% 0.24/1.42 # Positive unorientable unit clauses: 40
% 0.24/1.42 # Negative unit clauses : 0
% 0.24/1.42 # Non-unit-clauses : 0
% 0.24/1.42 # Current number of unprocessed clauses: 12398
% 0.24/1.42 # ...number of literals in the above : 12398
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 87
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.24/1.42 # Non-unit clause-clause subsumptions : 0
% 0.24/1.42 # Unit Clause-clause subsumption calls : 158
% 0.24/1.42 # Rewrite failures with RHS unbound : 50
% 0.24/1.42 # BW rewrite match attempts : 734
% 0.24/1.42 # BW rewrite match successes : 189
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 318831
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.291 s
% 0.24/1.42 # System time : 0.004 s
% 0.24/1.42 # Total time : 0.295 s
% 0.24/1.42 # Maximum resident set size: 19712 pages
%------------------------------------------------------------------------------