TSTP Solution File: CSR115+19 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+19 : 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:13 EDT 2022
% Result : Theorem 5.25s 2.68s
% Output : CNFRefutation 5.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 30 ( 14 unt; 0 nHn; 30 RR)
% Number of literals : 69 ( 0 equ; 50 neg)
% Maximal clause size : 7 ( 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 : 61 ( 37 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_819,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7)
| ~ sub(X6,name_1_1)
| ~ sub(X7,name_1_1)
| ~ prop(X2,britisch__1_1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kk72z854/lgb.p',i_0_819) ).
cnf(i_0_324,hypothesis,
prop(c131,britisch__1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kk72z854/lgb.p',i_0_324) ).
cnf(i_0_322,hypothesis,
sub(c132,name_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kk72z854/lgb.p',i_0_322) ).
cnf(i_0_325,hypothesis,
attr(c131,c132),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kk72z854/lgb.p',i_0_325) ).
cnf(i_0_678,plain,
( obj(esk24_2(X1,X2),X2)
| ~ loc(X2,X1)
| ~ has_fact_leq(X2,real) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kk72z854/lgb.p',i_0_678) ).
cnf(i_0_645,plain,
( has_fact_leq(X1,X2)
| ~ fact(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kk72z854/lgb.p',i_0_645) ).
cnf(i_0_237,hypothesis,
fact(c131,real),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kk72z854/lgb.p',i_0_237) ).
cnf(i_0_777,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-kk72z854/lgb.p',i_0_777) ).
cnf(i_0_579,plain,
state_adjective_state_binding(britisch__1_1,grossbritannien_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kk72z854/lgb.p',i_0_579) ).
cnf(i_0_329,hypothesis,
attr(c11,c12),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kk72z854/lgb.p',i_0_329) ).
cnf(c_0_830,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7)
| ~ sub(X6,name_1_1)
| ~ sub(X7,name_1_1)
| ~ prop(X2,britisch__1_1) ),
i_0_819 ).
cnf(c_0_831,hypothesis,
prop(c131,britisch__1_1),
i_0_324 ).
cnf(c_0_832,hypothesis,
( ~ sub(X1,name_1_1)
| ~ sub(X2,name_1_1)
| ~ attr(c131,X1)
| ~ attr(X3,X2)
| ~ attr(X4,X5)
| ~ obj(X6,c131) ),
inference(spm,[status(thm)],[c_0_830,c_0_831]) ).
cnf(c_0_833,hypothesis,
sub(c132,name_1_1),
i_0_322 ).
cnf(c_0_834,hypothesis,
attr(c131,c132),
i_0_325 ).
cnf(c_0_835,hypothesis,
( ~ sub(X1,name_1_1)
| ~ attr(X2,X1)
| ~ attr(X3,X4)
| ~ obj(X5,c131) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_832,c_0_833]),c_0_834])]) ).
cnf(c_0_836,hypothesis,
( ~ attr(X1,c132)
| ~ attr(X2,X3)
| ~ obj(X4,c131) ),
inference(spm,[status(thm)],[c_0_835,c_0_833]) ).
cnf(c_0_837,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,c131) ),
inference(spm,[status(thm)],[c_0_836,c_0_834]) ).
cnf(c_0_838,plain,
( obj(esk24_2(X1,X2),X2)
| ~ loc(X2,X1)
| ~ has_fact_leq(X2,real) ),
i_0_678 ).
cnf(c_0_839,plain,
( ~ has_fact_leq(c131,real)
| ~ loc(c131,X1)
| ~ attr(X2,X3) ),
inference(spm,[status(thm)],[c_0_837,c_0_838]) ).
cnf(c_0_840,plain,
( has_fact_leq(X1,X2)
| ~ fact(X1,X2) ),
i_0_645 ).
cnf(c_0_841,hypothesis,
fact(c131,real),
i_0_237 ).
cnf(c_0_842,plain,
( ~ loc(c131,X1)
| ~ attr(X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_839,c_0_840]),c_0_841])]) ).
cnf(c_0_843,plain,
( loc(X1,esk50_3(X1,X2,X3))
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
i_0_777 ).
cnf(c_0_844,plain,
( ~ state_adjective_state_binding(X1,X2)
| ~ prop(c131,X1)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_842,c_0_843]) ).
cnf(c_0_845,hypothesis,
( ~ state_adjective_state_binding(britisch__1_1,X1)
| ~ attr(X2,X3) ),
inference(spm,[status(thm)],[c_0_844,c_0_831]) ).
cnf(c_0_846,plain,
state_adjective_state_binding(britisch__1_1,grossbritannien_0),
i_0_579 ).
cnf(c_0_847,hypothesis,
attr(c11,c12),
i_0_329 ).
cnf(c_0_848,plain,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_845,c_0_846]) ).
cnf(c_0_849,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_847,c_0_848]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : CSR115+19 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jun 10 15:22:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.38/0.63 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.38/0.63 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.38/0.63 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.38/0.63 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.25/2.68 # ENIGMATIC: Solved by autoschedule-lgb:
% 5.25/2.68 # No SInE strategy applied
% 5.25/2.68 # Trying AutoSched0 for 150 seconds
% 5.25/2.68 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 5.25/2.68 # and selection function SelectComplexExceptUniqMaxHorn.
% 5.25/2.68 #
% 5.25/2.68 # Preprocessing time : 0.030 s
% 5.25/2.68 # Presaturation interreduction done
% 5.25/2.68
% 5.25/2.68 # Proof found!
% 5.25/2.68 # SZS status Theorem
% 5.25/2.68 # SZS output start CNFRefutation
% See solution above
% 5.25/2.68 # Training examples: 0 positive, 0 negative
% 5.25/2.68
% 5.25/2.68 # -------------------------------------------------
% 5.25/2.68 # User time : 0.050 s
% 5.25/2.68 # System time : 0.012 s
% 5.25/2.68 # Total time : 0.062 s
% 5.25/2.68 # Maximum resident set size: 7120 pages
% 5.25/2.68
%------------------------------------------------------------------------------