TSTP Solution File: CSR114+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR114+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:07 EDT 2022
% Result : Theorem 8.78s 2.82s
% Output : CNFRefutation 8.78s
% 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_783,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/sandbox/tmp/enigma-theBenchmark.p-awnchjio/lgb.p',i_0_783) ).
cnf(i_0_274,hypothesis,
val(c148,rom_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-awnchjio/lgb.p',i_0_274) ).
cnf(i_0_275,hypothesis,
sub(c148,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-awnchjio/lgb.p',i_0_275) ).
cnf(i_0_278,hypothesis,
sub(c140,kolosseum_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-awnchjio/lgb.p',i_0_278) ).
cnf(i_0_276,hypothesis,
sub(c147,stadt__1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-awnchjio/lgb.p',i_0_276) ).
cnf(i_0_277,hypothesis,
attr(c147,c148),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-awnchjio/lgb.p',i_0_277) ).
cnf(i_0_650,plain,
( subs(esk27_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-awnchjio/lgb.p',i_0_650) ).
cnf(i_0_651,plain,
( scar(esk27_2(X1,X2),X1)
| ~ loc(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-awnchjio/lgb.p',i_0_651) ).
cnf(i_0_652,plain,
( loc(esk27_2(X1,X2),X2)
| ~ loc(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-awnchjio/lgb.p',i_0_652) ).
cnf(i_0_271,hypothesis,
in(c169,c147),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-awnchjio/lgb.p',i_0_271) ).
cnf(i_0_279,hypothesis,
loc(c140,c169),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-awnchjio/lgb.p',i_0_279) ).
cnf(c_0_795,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_783 ).
cnf(c_0_796,hypothesis,
val(c148,rom_0),
i_0_274 ).
cnf(c_0_797,hypothesis,
sub(c148,name_1_1),
i_0_275 ).
cnf(c_0_798,hypothesis,
( ~ sub(X1,kolosseum_1_1)
| ~ sub(X2,stadt__1_1)
| ~ subs(X3,stehen_1_1)
| ~ attr(X2,c148)
| ~ scar(X3,X1)
| ~ loc(X3,X4)
| ~ in(X4,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_795,c_0_796]),c_0_797])]) ).
cnf(c_0_799,hypothesis,
sub(c140,kolosseum_1_1),
i_0_278 ).
cnf(c_0_800,hypothesis,
( ~ sub(X1,stadt__1_1)
| ~ subs(X2,stehen_1_1)
| ~ attr(X1,c148)
| ~ scar(X2,c140)
| ~ loc(X2,X3)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_798,c_0_799]) ).
cnf(c_0_801,hypothesis,
sub(c147,stadt__1_1),
i_0_276 ).
cnf(c_0_802,hypothesis,
attr(c147,c148),
i_0_277 ).
cnf(c_0_803,hypothesis,
( ~ subs(X1,stehen_1_1)
| ~ scar(X1,c140)
| ~ loc(X1,X2)
| ~ in(X2,c147) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_800,c_0_801]),c_0_802])]) ).
cnf(c_0_804,plain,
( subs(esk27_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
i_0_650 ).
cnf(c_0_805,plain,
( ~ scar(esk27_2(X1,X2),c140)
| ~ loc(esk27_2(X1,X2),X3)
| ~ loc(X1,X2)
| ~ in(X3,c147) ),
inference(spm,[status(thm)],[c_0_803,c_0_804]) ).
cnf(c_0_806,plain,
( scar(esk27_2(X1,X2),X1)
| ~ loc(X1,X2) ),
i_0_651 ).
cnf(c_0_807,plain,
( ~ loc(esk27_2(c140,X1),X2)
| ~ loc(c140,X1)
| ~ in(X2,c147) ),
inference(spm,[status(thm)],[c_0_805,c_0_806]) ).
cnf(c_0_808,plain,
( loc(esk27_2(X1,X2),X2)
| ~ loc(X1,X2) ),
i_0_652 ).
cnf(c_0_809,plain,
( ~ loc(c140,X1)
| ~ in(X1,c147) ),
inference(spm,[status(thm)],[c_0_807,c_0_808]) ).
cnf(c_0_810,hypothesis,
in(c169,c147),
i_0_271 ).
cnf(c_0_811,hypothesis,
loc(c140,c169),
i_0_279 ).
cnf(c_0_812,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_809,c_0_810]),c_0_811])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR114+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 11 04:30:13 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.36/0.60 # Parsing /export/starexec/sandbox/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
% 8.78/2.82 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.78/2.82 # No SInE strategy applied
% 8.78/2.82 # Trying AutoSched0 for 150 seconds
% 8.78/2.82 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.78/2.82 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.78/2.82 #
% 8.78/2.82 # Preprocessing time : 0.029 s
% 8.78/2.82 # Presaturation interreduction done
% 8.78/2.82
% 8.78/2.82 # Proof found!
% 8.78/2.82 # SZS status Theorem
% 8.78/2.82 # SZS output start CNFRefutation
% See solution above
% 8.78/2.82 # Training examples: 0 positive, 0 negative
% 8.78/2.82
% 8.78/2.82 # -------------------------------------------------
% 8.78/2.82 # User time : 0.044 s
% 8.78/2.82 # System time : 0.005 s
% 8.78/2.82 # Total time : 0.049 s
% 8.78/2.82 # Maximum resident set size: 7128 pages
% 8.78/2.82
%------------------------------------------------------------------------------