TSTP Solution File: KLE086+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE086+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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:50:03 EDT 2022
% Result : Theorem 9.12s 2.71s
% Output : CNFRefutation 9.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 23 unt; 0 def)
% Number of atoms : 23 ( 22 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
domain(zero) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(domain1,axiom,
! [X4] : multiplication(antidomain(X4),X4) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain1) ).
fof(domain4,axiom,
! [X4] : domain(X4) = antidomain(antidomain(X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain4) ).
fof(domain3,axiom,
! [X4] : addition(antidomain(antidomain(X4)),antidomain(X4)) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain3) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(c_0_6,negated_conjecture,
domain(zero) != zero,
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_7,plain,
! [X16] : multiplication(X16,one) = X16,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_8,plain,
! [X28] : multiplication(antidomain(X28),X28) = zero,
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_9,negated_conjecture,
domain(zero) != zero,
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X32] : domain(X32) = antidomain(antidomain(X32)),
inference(variable_rename,[status(thm)],[domain4]) ).
fof(c_0_11,plain,
! [X31] : addition(antidomain(antidomain(X31)),antidomain(X31)) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
cnf(c_0_12,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
multiplication(antidomain(X1),X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
! [X11] : addition(X11,zero) = X11,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_15,negated_conjecture,
domain(zero) != zero,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
antidomain(one) = zero,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
antidomain(antidomain(zero)) != zero,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
antidomain(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE086+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n003.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 07:44:58 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.12/2.71 # ENIGMATIC: Solved by autoschedule:
% 9.12/2.71 # No SInE strategy applied
% 9.12/2.71 # Trying AutoSched0 for 150 seconds
% 9.12/2.71 # AutoSched0-Mode selected heuristic G_____0010_evo
% 9.12/2.71 # and selection function SelectMaxLComplexAvoidPosPred.
% 9.12/2.71 #
% 9.12/2.71 # Preprocessing time : 0.013 s
% 9.12/2.71
% 9.12/2.71 # Proof found!
% 9.12/2.71 # SZS status Theorem
% 9.12/2.71 # SZS output start CNFRefutation
% See solution above
% 9.12/2.71 # Training examples: 0 positive, 0 negative
% 9.12/2.71
% 9.12/2.71 # -------------------------------------------------
% 9.12/2.71 # User time : 0.014 s
% 9.12/2.71 # System time : 0.006 s
% 9.12/2.71 # Total time : 0.020 s
% 9.12/2.71 # Maximum resident set size: 7116 pages
% 9.12/2.71
%------------------------------------------------------------------------------