%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS265+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:15 EDT 2022
% Result : Theorem 5.45s 2.03s
% Output : CNFRefutation 5.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 12 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 50 ( 23 ~; 17 |; 6 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 49 ( 4 sgn 27 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mighta_cax_thm,conjecture,
mighta(cax,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mighta_cax_thm) ).
fof(mighta,axiom,
! [X7,X8] :
( ? [X1,X2] :
( status(X1,X2,X7)
& status(X1,X2,X8) )
<=> mighta(X7,X8) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',mighta) ).
fof(cax,axiom,
! [X1,X2] :
( ~ ? [X3] : model(X3,X1)
<=> status(X1,X2,cax) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',cax) ).
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(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_6,negated_conjecture,
~ mighta(cax,thm),
inference(assume_negation,[status(cth)],[mighta_cax_thm]) ).
fof(c_0_7,negated_conjecture,
~ mighta(cax,thm),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X173,X174,X175,X176,X177,X178] :
( ( ~ status(X175,X176,X173)
| ~ status(X175,X176,X174)
| mighta(X173,X174) )
& ( status(esk43_2(X177,X178),esk44_2(X177,X178),X177)
| ~ mighta(X177,X178) )
& ( status(esk43_2(X177,X178),esk44_2(X177,X178),X178)
| ~ mighta(X177,X178) ) ),
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)],[mighta])])])])])]) ).
cnf(c_0_9,negated_conjecture,
~ mighta(cax,thm),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( mighta(X3,X4)
| ~ status(X1,X2,X3)
| ~ status(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X119,X121,X122,X123,X124] :
( ( model(esk30_1(X119),X119)
| status(X119,X121,cax) )
& ( ~ status(X122,X123,cax)
| ~ model(X124,X122) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[cax])])])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ status(X1,X2,thm)
| ~ status(X1,X2,cax) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( model(esk30_1(X1),X1)
| status(X1,X2,cax) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,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_15,negated_conjecture,
( model(esk30_1(X1),X1)
| ~ status(X1,X2,thm) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( status(X1,X2,thm)
| ~ model(esk10_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X220] : model(X220,esk53_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[tautology])]) ).
fof(c_0_18,plain,
! [X225] : ~ model(X225,esk57_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[contradiction])])]) ).
cnf(c_0_19,negated_conjecture,
( model(esk30_1(X1),X1)
| ~ model(esk10_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
model(X1,esk53_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
~ model(X1,esk57_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
model(esk30_1(X1),X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_21,c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : KRS265+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.00/0.08 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 600
% 0.08/0.27 % DateTime : Tue Jun 7 18:13:22 EDT 2022
% 0.08/0.27 % CPUTime :
% 0.12/0.35 # ENIGMATIC: Selected SinE mode:
% 0.12/0.36 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.12/0.36 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.12/0.36 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.45/2.03 # ENIGMATIC: Solved by autoschedule:
% 5.45/2.03 # No SInE strategy applied
% 5.45/2.03 # Trying AutoSched0 for 150 seconds
% 5.45/2.03 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YA
% 5.45/2.03 # and selection function SelectMaxLComplexAvoidPosPred.
% 5.45/2.03 #
% 5.45/2.03 # Preprocessing time : 0.018 s
% 5.45/2.03 # Presaturation interreduction done
% 5.45/2.03
% 5.45/2.03 # Proof found!
% 5.45/2.03 # SZS status Theorem
% 5.45/2.03 # SZS output start CNFRefutation
% See solution above
% 5.45/2.03 # Training examples: 0 positive, 0 negative
% 5.45/2.03
% 5.45/2.03 # -------------------------------------------------
% 5.45/2.03 # User time : 0.022 s
% 5.45/2.03 # System time : 0.006 s
% 5.45/2.03 # Total time : 0.028 s
% 5.45/2.03 # Maximum resident set size: 7120 pages
% 5.45/2.03
%------------------------------------------------------------------------------