TSTP Solution File: CSR115+55 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+55 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:20 EDT 2022
% Result : Theorem 7.36s 2.82s
% Output : CNFRefutation 7.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 14 unt; 0 nHn; 29 RR)
% Number of literals : 61 ( 0 equ; 42 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-3 aty)
% Number of variables : 53 ( 33 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_697,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ sub(X2,firma_1_1)
| ~ sub(X6,name_1_1)
| ~ prop(X2,britisch__1_1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2cy231fs/lgb.p',i_0_697) ).
cnf(i_0_207,hypothesis,
prop(c50830,britisch__1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2cy231fs/lgb.p',i_0_207) ).
cnf(i_0_206,hypothesis,
sub(c50830,firma_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2cy231fs/lgb.p',i_0_206) ).
cnf(i_0_209,hypothesis,
sub(c50826,name_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2cy231fs/lgb.p',i_0_209) ).
cnf(i_0_211,hypothesis,
attr(c50825,c50826),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2cy231fs/lgb.p',i_0_211) ).
cnf(i_0_556,plain,
( obj(esk24_2(X1,X2),X2)
| ~ loc(X2,X1)
| ~ has_fact_leq(X2,real) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2cy231fs/lgb.p',i_0_556) ).
cnf(i_0_523,plain,
( has_fact_leq(X1,X2)
| ~ fact(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2cy231fs/lgb.p',i_0_523) ).
cnf(i_0_144,hypothesis,
fact(c50830,real),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2cy231fs/lgb.p',i_0_144) ).
cnf(i_0_655,plain,
( loc(X1,esk50_3(X1,X2,X3))
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2cy231fs/lgb.p',i_0_655) ).
cnf(i_0_457,plain,
state_adjective_state_binding(britisch__1_1,grossbritannien_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2cy231fs/lgb.p',i_0_457) ).
cnf(c_0_708,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ sub(X2,firma_1_1)
| ~ sub(X6,name_1_1)
| ~ prop(X2,britisch__1_1) ),
i_0_697 ).
cnf(c_0_709,hypothesis,
prop(c50830,britisch__1_1),
i_0_207 ).
cnf(c_0_710,hypothesis,
sub(c50830,firma_1_1),
i_0_206 ).
cnf(c_0_711,hypothesis,
( ~ sub(X1,name_1_1)
| ~ attr(X2,X1)
| ~ attr(X3,X4)
| ~ obj(X5,c50830) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_708,c_0_709]),c_0_710])]) ).
cnf(c_0_712,hypothesis,
sub(c50826,name_1_1),
i_0_209 ).
cnf(c_0_713,hypothesis,
( ~ attr(X1,c50826)
| ~ attr(X2,X3)
| ~ obj(X4,c50830) ),
inference(spm,[status(thm)],[c_0_711,c_0_712]) ).
cnf(c_0_714,hypothesis,
attr(c50825,c50826),
i_0_211 ).
cnf(c_0_715,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,c50830) ),
inference(spm,[status(thm)],[c_0_713,c_0_714]) ).
cnf(c_0_716,plain,
( obj(esk24_2(X1,X2),X2)
| ~ loc(X2,X1)
| ~ has_fact_leq(X2,real) ),
i_0_556 ).
cnf(c_0_717,hypothesis,
( ~ has_fact_leq(c50830,real)
| ~ loc(c50830,X1)
| ~ attr(X2,X3) ),
inference(spm,[status(thm)],[c_0_715,c_0_716]) ).
cnf(c_0_718,plain,
( has_fact_leq(X1,X2)
| ~ fact(X1,X2) ),
i_0_523 ).
cnf(c_0_719,hypothesis,
fact(c50830,real),
i_0_144 ).
cnf(c_0_720,plain,
( ~ loc(c50830,X1)
| ~ attr(X2,X3) ),
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,plain,
( loc(X1,esk50_3(X1,X2,X3))
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
i_0_655 ).
cnf(c_0_722,plain,
( ~ state_adjective_state_binding(X1,X2)
| ~ prop(c50830,X1)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_720,c_0_721]) ).
cnf(c_0_723,hypothesis,
( ~ state_adjective_state_binding(britisch__1_1,X1)
| ~ attr(X2,X3) ),
inference(spm,[status(thm)],[c_0_722,c_0_709]) ).
cnf(c_0_724,plain,
state_adjective_state_binding(britisch__1_1,grossbritannien_0),
i_0_457 ).
cnf(c_0_725,plain,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_723,c_0_724]) ).
cnf(c_0_726,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_714,c_0_725]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR115+55 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n027.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 12:24:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.58 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.58 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.58 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.58 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.36/2.82 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.36/2.82 # No SInE strategy applied
% 7.36/2.82 # Trying AutoSched0 for 150 seconds
% 7.36/2.82 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.36/2.82 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.36/2.82 #
% 7.36/2.82 # Preprocessing time : 0.029 s
% 7.36/2.82 # Presaturation interreduction done
% 7.36/2.82
% 7.36/2.82 # Proof found!
% 7.36/2.82 # SZS status Theorem
% 7.36/2.82 # SZS output start CNFRefutation
% See solution above
% 7.36/2.82 # Training examples: 0 positive, 0 negative
% 7.36/2.82
% 7.36/2.82 # -------------------------------------------------
% 7.36/2.82 # User time : 0.055 s
% 7.36/2.82 # System time : 0.009 s
% 7.36/2.82 # Total time : 0.064 s
% 7.36/2.82 # Maximum resident set size: 7120 pages
% 7.36/2.82
%------------------------------------------------------------------------------