TSTP Solution File: CSR113+28 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR113+28 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:04 EDT 2022
% Result : Theorem 8.41s 2.86s
% Output : CNFRefutation 8.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 12 unt; 0 nHn; 27 RR)
% Number of literals : 60 ( 0 equ; 40 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 42 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_684,negated_conjecture,
( ~ loc(X1,X2)
| ~ scar(X1,X3)
| ~ flp(X2,X4)
| ~ subs(X1,stehen_1_1)
| ~ sub(X5,name_1_1)
| ~ sub(X3,freiheitsstatue_1_1)
| ~ val(X5,new_york_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6k3voguq/lgb.p',i_0_684) ).
cnf(i_0_187,hypothesis,
val(c55,new_york_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6k3voguq/lgb.p',i_0_187) ).
cnf(i_0_188,hypothesis,
sub(c55,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6k3voguq/lgb.p',i_0_188) ).
cnf(i_0_193,hypothesis,
sub(c44,freiheitsstatue_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6k3voguq/lgb.p',i_0_193) ).
cnf(i_0_551,plain,
( subs(esk27_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6k3voguq/lgb.p',i_0_551) ).
cnf(i_0_552,plain,
( scar(esk27_2(X1,X2),X1)
| ~ loc(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6k3voguq/lgb.p',i_0_552) ).
cnf(i_0_553,plain,
( loc(esk27_2(X1,X2),X2)
| ~ loc(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6k3voguq/lgb.p',i_0_553) ).
cnf(i_0_541,plain,
( flp(X1,X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6k3voguq/lgb.p',i_0_541) ).
cnf(i_0_185,hypothesis,
in(c58,c49),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6k3voguq/lgb.p',i_0_185) ).
cnf(i_0_194,hypothesis,
loc(c44,c58),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6k3voguq/lgb.p',i_0_194) ).
cnf(c_0_695,negated_conjecture,
( ~ loc(X1,X2)
| ~ scar(X1,X3)
| ~ flp(X2,X4)
| ~ subs(X1,stehen_1_1)
| ~ sub(X5,name_1_1)
| ~ sub(X3,freiheitsstatue_1_1)
| ~ val(X5,new_york_0) ),
i_0_684 ).
cnf(c_0_696,hypothesis,
val(c55,new_york_0),
i_0_187 ).
cnf(c_0_697,hypothesis,
sub(c55,name_1_1),
i_0_188 ).
cnf(c_0_698,hypothesis,
( ~ sub(X1,freiheitsstatue_1_1)
| ~ subs(X2,stehen_1_1)
| ~ flp(X3,X4)
| ~ scar(X2,X1)
| ~ loc(X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_695,c_0_696]),c_0_697])]) ).
cnf(c_0_699,hypothesis,
sub(c44,freiheitsstatue_1_1),
i_0_193 ).
cnf(c_0_700,hypothesis,
( ~ subs(X1,stehen_1_1)
| ~ flp(X2,X3)
| ~ scar(X1,c44)
| ~ loc(X1,X2) ),
inference(spm,[status(thm)],[c_0_698,c_0_699]) ).
cnf(c_0_701,plain,
( subs(esk27_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
i_0_551 ).
cnf(c_0_702,plain,
( ~ flp(X1,X2)
| ~ scar(esk27_2(X3,X4),c44)
| ~ loc(esk27_2(X3,X4),X1)
| ~ loc(X3,X4) ),
inference(spm,[status(thm)],[c_0_700,c_0_701]) ).
cnf(c_0_703,plain,
( scar(esk27_2(X1,X2),X1)
| ~ loc(X1,X2) ),
i_0_552 ).
cnf(c_0_704,plain,
( ~ flp(X1,X2)
| ~ loc(esk27_2(c44,X3),X1)
| ~ loc(c44,X3) ),
inference(spm,[status(thm)],[c_0_702,c_0_703]) ).
cnf(c_0_705,plain,
( loc(esk27_2(X1,X2),X2)
| ~ loc(X1,X2) ),
i_0_553 ).
cnf(c_0_706,plain,
( flp(X1,X2)
| ~ in(X1,X2) ),
i_0_541 ).
cnf(c_0_707,hypothesis,
in(c58,c49),
i_0_185 ).
cnf(c_0_708,plain,
( ~ flp(X1,X2)
| ~ loc(c44,X1) ),
inference(spm,[status(thm)],[c_0_704,c_0_705]) ).
cnf(c_0_709,plain,
flp(c58,c49),
inference(spm,[status(thm)],[c_0_706,c_0_707]) ).
cnf(c_0_710,hypothesis,
loc(c44,c58),
i_0_194 ).
cnf(c_0_711,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_708,c_0_709]),c_0_710])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR113+28 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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 19:00:49 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.36/0.59 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.36/0.59 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.36/0.59 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.36/0.59 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.41/2.86 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.41/2.86 # No SInE strategy applied
% 8.41/2.86 # Trying AutoSched0 for 150 seconds
% 8.41/2.86 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.41/2.86 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.41/2.86 #
% 8.41/2.86 # Preprocessing time : 0.028 s
% 8.41/2.86 # Presaturation interreduction done
% 8.41/2.86
% 8.41/2.86 # Proof found!
% 8.41/2.86 # SZS status Theorem
% 8.41/2.86 # SZS output start CNFRefutation
% See solution above
% 8.41/2.86 # Training examples: 0 positive, 0 negative
% 8.41/2.86
% 8.41/2.86 # -------------------------------------------------
% 8.41/2.86 # User time : 0.053 s
% 8.41/2.86 # System time : 0.005 s
% 8.41/2.86 # Total time : 0.058 s
% 8.41/2.86 # Maximum resident set size: 7128 pages
% 8.41/2.86
%------------------------------------------------------------------------------