TSTP Solution File: CSR114+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR114+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:10 EDT 2022
% Result : Theorem 5.73s 2.64s
% Output : CNFRefutation 5.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 29 ( 15 unt; 0 nHn; 29 RR)
% Number of literals : 71 ( 0 equ; 50 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_812,negated_conjecture,
( ~ in(X1,X2)
| ~ loc(X3,X1)
| ~ scar(X3,X4)
| ~ attr(X2,X5)
| ~ subs(X3,stehen_1_1)
| ~ sub(X4,kolosseum_1_1)
| ~ sub(X5,name_1_1)
| ~ sub(X2,stadt__1_1)
| ~ val(X5,rom_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q3bvnpjf/lgb.p',i_0_812) ).
cnf(i_0_297,hypothesis,
val(c400,rom_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q3bvnpjf/lgb.p',i_0_297) ).
cnf(i_0_298,hypothesis,
sub(c400,name_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q3bvnpjf/lgb.p',i_0_298) ).
cnf(i_0_302,hypothesis,
sub(c393,kolosseum_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q3bvnpjf/lgb.p',i_0_302) ).
cnf(i_0_300,hypothesis,
sub(c399,stadt__1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q3bvnpjf/lgb.p',i_0_300) ).
cnf(i_0_301,hypothesis,
attr(c399,c400),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q3bvnpjf/lgb.p',i_0_301) ).
cnf(i_0_679,plain,
( subs(esk27_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q3bvnpjf/lgb.p',i_0_679) ).
cnf(i_0_680,plain,
( scar(esk27_2(X1,X2),X1)
| ~ loc(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q3bvnpjf/lgb.p',i_0_680) ).
cnf(i_0_681,plain,
( loc(esk27_2(X1,X2),X2)
| ~ loc(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q3bvnpjf/lgb.p',i_0_681) ).
cnf(i_0_296,hypothesis,
in(c402,c399),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q3bvnpjf/lgb.p',i_0_296) ).
cnf(i_0_303,hypothesis,
loc(c393,c402),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q3bvnpjf/lgb.p',i_0_303) ).
cnf(c_0_824,negated_conjecture,
( ~ in(X1,X2)
| ~ loc(X3,X1)
| ~ scar(X3,X4)
| ~ attr(X2,X5)
| ~ subs(X3,stehen_1_1)
| ~ sub(X4,kolosseum_1_1)
| ~ sub(X5,name_1_1)
| ~ sub(X2,stadt__1_1)
| ~ val(X5,rom_0) ),
i_0_812 ).
cnf(c_0_825,hypothesis,
val(c400,rom_0),
i_0_297 ).
cnf(c_0_826,hypothesis,
sub(c400,name_1_1),
i_0_298 ).
cnf(c_0_827,hypothesis,
( ~ sub(X1,kolosseum_1_1)
| ~ sub(X2,stadt__1_1)
| ~ subs(X3,stehen_1_1)
| ~ attr(X2,c400)
| ~ scar(X3,X1)
| ~ loc(X3,X4)
| ~ in(X4,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_824,c_0_825]),c_0_826])]) ).
cnf(c_0_828,hypothesis,
sub(c393,kolosseum_1_1),
i_0_302 ).
cnf(c_0_829,hypothesis,
( ~ sub(X1,stadt__1_1)
| ~ subs(X2,stehen_1_1)
| ~ attr(X1,c400)
| ~ scar(X2,c393)
| ~ loc(X2,X3)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_827,c_0_828]) ).
cnf(c_0_830,hypothesis,
sub(c399,stadt__1_1),
i_0_300 ).
cnf(c_0_831,hypothesis,
attr(c399,c400),
i_0_301 ).
cnf(c_0_832,hypothesis,
( ~ subs(X1,stehen_1_1)
| ~ scar(X1,c393)
| ~ loc(X1,X2)
| ~ in(X2,c399) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_829,c_0_830]),c_0_831])]) ).
cnf(c_0_833,plain,
( subs(esk27_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
i_0_679 ).
cnf(c_0_834,plain,
( ~ scar(esk27_2(X1,X2),c393)
| ~ loc(esk27_2(X1,X2),X3)
| ~ loc(X1,X2)
| ~ in(X3,c399) ),
inference(spm,[status(thm)],[c_0_832,c_0_833]) ).
cnf(c_0_835,plain,
( scar(esk27_2(X1,X2),X1)
| ~ loc(X1,X2) ),
i_0_680 ).
cnf(c_0_836,plain,
( ~ loc(esk27_2(c393,X1),X2)
| ~ loc(c393,X1)
| ~ in(X2,c399) ),
inference(spm,[status(thm)],[c_0_834,c_0_835]) ).
cnf(c_0_837,plain,
( loc(esk27_2(X1,X2),X2)
| ~ loc(X1,X2) ),
i_0_681 ).
cnf(c_0_838,plain,
( ~ loc(c393,X1)
| ~ in(X1,c399) ),
inference(spm,[status(thm)],[c_0_836,c_0_837]) ).
cnf(c_0_839,hypothesis,
in(c402,c399),
i_0_296 ).
cnf(c_0_840,hypothesis,
loc(c393,c402),
i_0_303 ).
cnf(c_0_841,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_838,c_0_839]),c_0_840])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CSR114+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n025.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 : Sat Jun 11 13:48:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.36/0.60 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.36/0.60 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.36/0.60 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.36/0.60 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.73/2.64 # ENIGMATIC: Solved by autoschedule-lgb:
% 5.73/2.64 # No SInE strategy applied
% 5.73/2.64 # Trying AutoSched0 for 150 seconds
% 5.73/2.64 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 5.73/2.64 # and selection function SelectComplexExceptUniqMaxHorn.
% 5.73/2.64 #
% 5.73/2.64 # Preprocessing time : 0.029 s
% 5.73/2.64 # Presaturation interreduction done
% 5.73/2.64
% 5.73/2.64 # Proof found!
% 5.73/2.64 # SZS status Theorem
% 5.73/2.64 # SZS output start CNFRefutation
% See solution above
% 5.73/2.64 # Training examples: 0 positive, 0 negative
% 5.73/2.64
% 5.73/2.64 # -------------------------------------------------
% 5.73/2.64 # User time : 0.051 s
% 5.73/2.64 # System time : 0.011 s
% 5.73/2.64 # Total time : 0.062 s
% 5.73/2.64 # Maximum resident set size: 7120 pages
% 5.73/2.64
%------------------------------------------------------------------------------