TSTP Solution File: KRS215+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS215+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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 02:56:07 EDT 2022
% Result : Theorem 8.14s 2.51s
% Output : CNFRefutation 8.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 11 unt; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 78 ( 33 ~; 31 |; 9 &)
% ( 3 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 66 ( 4 sgn 31 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(nota_csa_thm,conjecture,
nota(csa,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nota_csa_thm) ).
fof(nota,axiom,
! [X7,X8] :
( ? [X1,X2] :
( status(X1,X2,X7)
& ~ status(X1,X2,X8) )
<=> nota(X7,X8) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',nota) ).
fof(csa,axiom,
! [X1,X2] :
( ? [X3] :
( model(X3,X1)
& model(X3,not(X2)) )
<=> status(X1,X2,csa) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',csa) ).
fof(thm,axiom,
! [X1,X2] :
( ! [X3] :
( model(X3,X1)
=> model(X3,X2) )
<=> status(X1,X2,thm) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',thm) ).
fof(completeness,axiom,
! [X9,X10] :
( model(X9,X10)
<~> model(X9,not(X10)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',completeness) ).
fof(tautology,axiom,
? [X10] :
! [X9] : model(X9,X10),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',tautology) ).
fof(contradiction,axiom,
? [X10] :
! [X9] : ~ model(X9,X10),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',contradiction) ).
fof(c_0_7,negated_conjecture,
~ nota(csa,thm),
inference(assume_negation,[status(cth)],[nota_csa_thm]) ).
fof(c_0_8,negated_conjecture,
~ nota(csa,thm),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,plain,
! [X189,X190,X191,X192,X193,X194] :
( ( ~ status(X191,X192,X189)
| status(X191,X192,X190)
| nota(X189,X190) )
& ( status(esk47_2(X193,X194),esk48_2(X193,X194),X193)
| ~ nota(X193,X194) )
& ( ~ status(esk47_2(X193,X194),esk48_2(X193,X194),X194)
| ~ nota(X193,X194) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[nota])])])])])])]) ).
cnf(c_0_10,negated_conjecture,
~ nota(csa,thm),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( status(X1,X2,X4)
| nota(X3,X4)
| ~ status(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X151,X152,X153,X154,X155] :
( ( ~ model(X153,X151)
| ~ model(X153,not(X152))
| status(X151,X152,csa) )
& ( model(esk38_2(X154,X155),X154)
| ~ status(X154,X155,csa) )
& ( model(esk38_2(X154,X155),not(X155))
| ~ status(X154,X155,csa) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[csa])])])])])]) ).
fof(c_0_13,plain,
! [X45,X46,X48,X49,X50] :
( ( model(esk10_2(X45,X46),X45)
| status(X45,X46,thm) )
& ( ~ model(esk10_2(X45,X46),X46)
| status(X45,X46,thm) )
& ( ~ status(X48,X49,thm)
| ~ model(X50,X48)
| model(X50,X49) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[thm])])])])])]) ).
cnf(c_0_14,negated_conjecture,
( status(X1,X2,thm)
| ~ status(X1,X2,csa) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( status(X2,X3,csa)
| ~ model(X1,X2)
| ~ model(X1,not(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( model(X3,X2)
| ~ status(X1,X2,thm)
| ~ model(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( status(X1,X2,thm)
| ~ model(X3,not(X2))
| ~ model(X3,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_18,plain,
! [X215,X216] :
( ( ~ model(X215,X216)
| ~ model(X215,not(X216)) )
& ( model(X215,X216)
| model(X215,not(X216)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[completeness])])]) ).
cnf(c_0_19,negated_conjecture,
( model(X1,X2)
| ~ model(X3,not(X2))
| ~ model(X1,X4)
| ~ model(X3,X4) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( model(X1,X2)
| model(X1,not(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_21,plain,
! [X220] : model(X220,esk53_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[tautology])]) ).
fof(c_0_22,plain,
! [X225] : ~ model(X225,esk57_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[contradiction])])]) ).
cnf(c_0_23,negated_conjecture,
( model(X1,X2)
| model(X3,X2)
| ~ model(X3,X4)
| ~ model(X1,X4) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
model(X1,esk53_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
~ model(X1,esk57_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( model(X1,X2)
| model(X3,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS215+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n020.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Tue Jun 7 17:32:23 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected SinE mode:
% 0.17/0.43 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.43 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.17/0.43 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.17/0.43 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.14/2.51 # ENIGMATIC: Solved by autoschedule:
% 8.14/2.51 # No SInE strategy applied
% 8.14/2.51 # Trying AutoSched0 for 150 seconds
% 8.14/2.51 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YA
% 8.14/2.51 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.14/2.51 #
% 8.14/2.51 # Preprocessing time : 0.018 s
% 8.14/2.51 # Presaturation interreduction done
% 8.14/2.51
% 8.14/2.51 # Proof found!
% 8.14/2.51 # SZS status Theorem
% 8.14/2.51 # SZS output start CNFRefutation
% See solution above
% 8.14/2.51 # Training examples: 0 positive, 0 negative
% 8.14/2.51
% 8.14/2.51 # -------------------------------------------------
% 8.14/2.51 # User time : 0.025 s
% 8.14/2.51 # System time : 0.009 s
% 8.14/2.51 # Total time : 0.033 s
% 8.14/2.51 # Maximum resident set size: 7124 pages
% 8.14/2.51
%------------------------------------------------------------------------------