TSTP Solution File: CSR113+15 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR113+15 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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 : Fri Jul 15 02:49:01 EDT 2022
% Result : Theorem 5.64s 2.66s
% Output : CNFRefutation 5.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 11 unt; 0 nHn; 25 RR)
% Number of literals : 52 ( 0 equ; 34 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 43 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_690,negated_conjecture,
( ~ loc(X1,X2)
| ~ scar(X1,X3)
| ~ flp(X2,X4)
| ~ subs(X1,stehen_1_1)
| ~ sub(X5,name_1_1)
| ~ val(X5,new_york_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bxtfu4vn/lgb.p',i_0_690) ).
cnf(i_0_198,hypothesis,
val(c31,new_york_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bxtfu4vn/lgb.p',i_0_198) ).
cnf(i_0_199,hypothesis,
sub(c31,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bxtfu4vn/lgb.p',i_0_199) ).
cnf(i_0_557,plain,
( subs(esk27_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bxtfu4vn/lgb.p',i_0_557) ).
cnf(i_0_558,plain,
( scar(esk27_2(X1,X2),X1)
| ~ loc(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bxtfu4vn/lgb.p',i_0_558) ).
cnf(i_0_559,plain,
( loc(esk27_2(X1,X2),X2)
| ~ loc(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bxtfu4vn/lgb.p',i_0_559) ).
cnf(i_0_547,plain,
( flp(X1,X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bxtfu4vn/lgb.p',i_0_547) ).
cnf(i_0_189,hypothesis,
in(c79,c23),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bxtfu4vn/lgb.p',i_0_189) ).
cnf(i_0_196,hypothesis,
loc(c43,c79),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bxtfu4vn/lgb.p',i_0_196) ).
cnf(c_0_700,negated_conjecture,
( ~ loc(X1,X2)
| ~ scar(X1,X3)
| ~ flp(X2,X4)
| ~ subs(X1,stehen_1_1)
| ~ sub(X5,name_1_1)
| ~ val(X5,new_york_0) ),
i_0_690 ).
cnf(c_0_701,hypothesis,
val(c31,new_york_0),
i_0_198 ).
cnf(c_0_702,hypothesis,
sub(c31,name_1_1),
i_0_199 ).
cnf(c_0_703,hypothesis,
( ~ subs(X1,stehen_1_1)
| ~ flp(X2,X3)
| ~ scar(X1,X4)
| ~ loc(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_700,c_0_701]),c_0_702])]) ).
cnf(c_0_704,plain,
( subs(esk27_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
i_0_557 ).
cnf(c_0_705,plain,
( ~ flp(X1,X2)
| ~ scar(esk27_2(X3,X4),X5)
| ~ loc(esk27_2(X3,X4),X1)
| ~ loc(X3,X4) ),
inference(spm,[status(thm)],[c_0_703,c_0_704]) ).
cnf(c_0_706,plain,
( scar(esk27_2(X1,X2),X1)
| ~ loc(X1,X2) ),
i_0_558 ).
cnf(c_0_707,plain,
( ~ flp(X1,X2)
| ~ loc(esk27_2(X3,X4),X1)
| ~ loc(X3,X4) ),
inference(spm,[status(thm)],[c_0_705,c_0_706]) ).
cnf(c_0_708,plain,
( loc(esk27_2(X1,X2),X2)
| ~ loc(X1,X2) ),
i_0_559 ).
cnf(c_0_709,plain,
( flp(X1,X2)
| ~ in(X1,X2) ),
i_0_547 ).
cnf(c_0_710,hypothesis,
in(c79,c23),
i_0_189 ).
cnf(c_0_711,plain,
( ~ flp(X1,X2)
| ~ loc(X3,X1) ),
inference(spm,[status(thm)],[c_0_707,c_0_708]) ).
cnf(c_0_712,plain,
flp(c79,c23),
inference(spm,[status(thm)],[c_0_709,c_0_710]) ).
cnf(c_0_713,hypothesis,
loc(c43,c79),
i_0_196 ).
cnf(c_0_714,plain,
~ loc(X1,c79),
inference(spm,[status(thm)],[c_0_711,c_0_712]) ).
cnf(c_0_715,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_713,c_0_714]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR113+15 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n029.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 9 22:02:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.38/0.59 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.59 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.38/0.59 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.38/0.59 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.64/2.66 # ENIGMATIC: Solved by autoschedule-lgb:
% 5.64/2.66 # No SInE strategy applied
% 5.64/2.66 # Trying AutoSched0 for 150 seconds
% 5.64/2.66 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 5.64/2.66 # and selection function SelectComplexExceptUniqMaxHorn.
% 5.64/2.66 #
% 5.64/2.66 # Preprocessing time : 0.024 s
% 5.64/2.66 # Presaturation interreduction done
% 5.64/2.66
% 5.64/2.66 # Proof found!
% 5.64/2.66 # SZS status Theorem
% 5.64/2.66 # SZS output start CNFRefutation
% See solution above
% 5.64/2.66 # Training examples: 0 positive, 0 negative
% 5.64/2.66
% 5.64/2.66 # -------------------------------------------------
% 5.64/2.66 # User time : 0.037 s
% 5.64/2.66 # System time : 0.011 s
% 5.64/2.66 # Total time : 0.047 s
% 5.64/2.66 # Maximum resident set size: 7124 pages
% 5.64/2.66
%------------------------------------------------------------------------------