TSTP Solution File: CSR114+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR114+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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 8.83s 2.70s
% Output : CNFRefutation 8.83s
% 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_705,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-sbdvbdf9/lgb.p',i_0_705) ).
cnf(i_0_207,hypothesis,
val(c12595,rom_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sbdvbdf9/lgb.p',i_0_207) ).
cnf(i_0_208,hypothesis,
sub(c12595,name_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sbdvbdf9/lgb.p',i_0_208) ).
cnf(i_0_211,hypothesis,
sub(c12583,kolosseum_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sbdvbdf9/lgb.p',i_0_211) ).
cnf(i_0_209,hypothesis,
sub(c12594,stadt__1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sbdvbdf9/lgb.p',i_0_209) ).
cnf(i_0_210,hypothesis,
attr(c12594,c12595),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sbdvbdf9/lgb.p',i_0_210) ).
cnf(i_0_572,plain,
( subs(esk27_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sbdvbdf9/lgb.p',i_0_572) ).
cnf(i_0_573,plain,
( scar(esk27_2(X1,X2),X1)
| ~ loc(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sbdvbdf9/lgb.p',i_0_573) ).
cnf(i_0_574,plain,
( loc(esk27_2(X1,X2),X2)
| ~ loc(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sbdvbdf9/lgb.p',i_0_574) ).
cnf(i_0_202,hypothesis,
in(c12608,c12594),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sbdvbdf9/lgb.p',i_0_202) ).
cnf(i_0_212,hypothesis,
loc(c12583,c12608),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-sbdvbdf9/lgb.p',i_0_212) ).
cnf(c_0_717,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_705 ).
cnf(c_0_718,hypothesis,
val(c12595,rom_0),
i_0_207 ).
cnf(c_0_719,hypothesis,
sub(c12595,name_1_1),
i_0_208 ).
cnf(c_0_720,hypothesis,
( ~ sub(X1,kolosseum_1_1)
| ~ sub(X2,stadt__1_1)
| ~ subs(X3,stehen_1_1)
| ~ attr(X2,c12595)
| ~ scar(X3,X1)
| ~ loc(X3,X4)
| ~ in(X4,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_717,c_0_718]),c_0_719])]) ).
cnf(c_0_721,hypothesis,
sub(c12583,kolosseum_1_1),
i_0_211 ).
cnf(c_0_722,hypothesis,
( ~ sub(X1,stadt__1_1)
| ~ subs(X2,stehen_1_1)
| ~ attr(X1,c12595)
| ~ scar(X2,c12583)
| ~ loc(X2,X3)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_720,c_0_721]) ).
cnf(c_0_723,hypothesis,
sub(c12594,stadt__1_1),
i_0_209 ).
cnf(c_0_724,hypothesis,
attr(c12594,c12595),
i_0_210 ).
cnf(c_0_725,hypothesis,
( ~ subs(X1,stehen_1_1)
| ~ scar(X1,c12583)
| ~ loc(X1,X2)
| ~ in(X2,c12594) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_722,c_0_723]),c_0_724])]) ).
cnf(c_0_726,plain,
( subs(esk27_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
i_0_572 ).
cnf(c_0_727,plain,
( ~ scar(esk27_2(X1,X2),c12583)
| ~ loc(esk27_2(X1,X2),X3)
| ~ loc(X1,X2)
| ~ in(X3,c12594) ),
inference(spm,[status(thm)],[c_0_725,c_0_726]) ).
cnf(c_0_728,plain,
( scar(esk27_2(X1,X2),X1)
| ~ loc(X1,X2) ),
i_0_573 ).
cnf(c_0_729,plain,
( ~ loc(esk27_2(c12583,X1),X2)
| ~ loc(c12583,X1)
| ~ in(X2,c12594) ),
inference(spm,[status(thm)],[c_0_727,c_0_728]) ).
cnf(c_0_730,plain,
( loc(esk27_2(X1,X2),X2)
| ~ loc(X1,X2) ),
i_0_574 ).
cnf(c_0_731,plain,
( ~ loc(c12583,X1)
| ~ in(X1,c12594) ),
inference(spm,[status(thm)],[c_0_729,c_0_730]) ).
cnf(c_0_732,hypothesis,
in(c12608,c12594),
i_0_202 ).
cnf(c_0_733,hypothesis,
loc(c12583,c12608),
i_0_212 ).
cnf(c_0_734,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_731,c_0_732]),c_0_733])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CSR114+4 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.30 % Computer : n018.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Fri Jun 10 03:47:40 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.15/0.39 # ENIGMATIC: Selected SinE mode:
% 0.15/0.51 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.51 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.15/0.51 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.15/0.51 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.83/2.70 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.83/2.70 # No SInE strategy applied
% 8.83/2.70 # Trying AutoSched0 for 150 seconds
% 8.83/2.70 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.83/2.70 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.83/2.70 #
% 8.83/2.70 # Preprocessing time : 0.027 s
% 8.83/2.70 # Presaturation interreduction done
% 8.83/2.70
% 8.83/2.70 # Proof found!
% 8.83/2.70 # SZS status Theorem
% 8.83/2.70 # SZS output start CNFRefutation
% See solution above
% 8.83/2.70 # Training examples: 0 positive, 0 negative
% 8.83/2.70
% 8.83/2.70 # -------------------------------------------------
% 8.83/2.70 # User time : 0.049 s
% 8.83/2.70 # System time : 0.005 s
% 8.83/2.70 # Total time : 0.054 s
% 8.83/2.70 # Maximum resident set size: 7124 pages
% 8.83/2.70
%------------------------------------------------------------------------------