TSTP Solution File: SEU391+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU391+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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 : Tue Jul 19 08:41:48 EDT 2022
% Result : Theorem 8.55s 2.45s
% Output : CNFRefutation 8.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 35 ( 13 unt; 15 nHn; 35 RR)
% Number of literals : 107 ( 8 equ; 54 neg)
% Maximal clause size : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_55,plain,
( a_2_1_yellow19(X1,X2) = filter_of_net_str(X1,X2)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bnuwj9qq/lgb.p',i_0_55) ).
cnf(i_0_317,negated_conjecture,
net_str(esk36_0,esk35_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bnuwj9qq/lgb.p',i_0_317) ).
cnf(i_0_319,negated_conjecture,
one_sorted_str(esk35_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bnuwj9qq/lgb.p',i_0_319) ).
cnf(i_0_320,negated_conjecture,
~ empty_carrier(esk35_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bnuwj9qq/lgb.p',i_0_320) ).
cnf(i_0_318,negated_conjecture,
~ empty_carrier(esk36_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bnuwj9qq/lgb.p',i_0_318) ).
cnf(i_0_171,plain,
( esk7_3(X1,X2,X3) = X1
| empty_carrier(X3)
| empty_carrier(X2)
| ~ one_sorted_str(X2)
| ~ net_str(X3,X2)
| ~ in(X1,a_2_1_yellow19(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bnuwj9qq/lgb.p',i_0_171) ).
cnf(i_0_172,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| element(esk7_3(X3,X2,X1),powerset(the_carrier(X2)))
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ in(X3,a_2_1_yellow19(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bnuwj9qq/lgb.p',i_0_172) ).
cnf(i_0_170,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X2,X1,esk7_3(X3,X2,X1))
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ in(X3,a_2_1_yellow19(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bnuwj9qq/lgb.p',i_0_170) ).
cnf(i_0_316,negated_conjecture,
( ~ is_eventually_in(esk35_0,esk36_0,esk37_0)
| ~ element(esk37_0,powerset(the_carrier(esk35_0)))
| ~ in(esk37_0,filter_of_net_str(esk35_0,esk36_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bnuwj9qq/lgb.p',i_0_316) ).
cnf(i_0_315,negated_conjecture,
( is_eventually_in(esk35_0,esk36_0,esk37_0)
| in(esk37_0,filter_of_net_str(esk35_0,esk36_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bnuwj9qq/lgb.p',i_0_315) ).
cnf(i_0_169,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(X3,a_2_1_yellow19(X2,X1))
| X4 != X3
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ is_eventually_in(X2,X1,X4)
| ~ element(X4,powerset(the_carrier(X2))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bnuwj9qq/lgb.p',i_0_169) ).
cnf(i_0_314,negated_conjecture,
( element(esk37_0,powerset(the_carrier(esk35_0)))
| in(esk37_0,filter_of_net_str(esk35_0,esk36_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bnuwj9qq/lgb.p',i_0_314) ).
cnf(c_0_333,plain,
( a_2_1_yellow19(X1,X2) = filter_of_net_str(X1,X2)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1) ),
i_0_55 ).
cnf(c_0_334,negated_conjecture,
net_str(esk36_0,esk35_0),
i_0_317 ).
cnf(c_0_335,negated_conjecture,
one_sorted_str(esk35_0),
i_0_319 ).
cnf(c_0_336,negated_conjecture,
~ empty_carrier(esk35_0),
i_0_320 ).
cnf(c_0_337,negated_conjecture,
~ empty_carrier(esk36_0),
i_0_318 ).
cnf(c_0_338,plain,
( esk7_3(X1,X2,X3) = X1
| empty_carrier(X3)
| empty_carrier(X2)
| ~ one_sorted_str(X2)
| ~ net_str(X3,X2)
| ~ in(X1,a_2_1_yellow19(X2,X3)) ),
i_0_171 ).
cnf(c_0_339,negated_conjecture,
a_2_1_yellow19(esk35_0,esk36_0) = filter_of_net_str(esk35_0,esk36_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_333,c_0_334]),c_0_335])]),c_0_336]),c_0_337]) ).
cnf(c_0_340,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| element(esk7_3(X3,X2,X1),powerset(the_carrier(X2)))
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ in(X3,a_2_1_yellow19(X2,X1)) ),
i_0_172 ).
cnf(c_0_341,plain,
( esk7_3(X1,esk35_0,esk36_0) = X1
| ~ in(X1,filter_of_net_str(esk35_0,esk36_0)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_338,c_0_339]),c_0_335]),c_0_334])]),c_0_336]),c_0_337]) ).
cnf(c_0_342,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X2,X1,esk7_3(X3,X2,X1))
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ in(X3,a_2_1_yellow19(X2,X1)) ),
i_0_170 ).
cnf(c_0_343,negated_conjecture,
( ~ is_eventually_in(esk35_0,esk36_0,esk37_0)
| ~ element(esk37_0,powerset(the_carrier(esk35_0)))
| ~ in(esk37_0,filter_of_net_str(esk35_0,esk36_0)) ),
i_0_316 ).
cnf(c_0_344,plain,
( element(X1,powerset(the_carrier(esk35_0)))
| ~ in(X1,filter_of_net_str(esk35_0,esk36_0)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_340,c_0_341]),c_0_335]),c_0_334]),c_0_339])]),c_0_337]),c_0_336]) ).
cnf(c_0_345,plain,
( is_eventually_in(esk35_0,esk36_0,X1)
| ~ in(X1,filter_of_net_str(esk35_0,esk36_0)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_342,c_0_341]),c_0_335]),c_0_334]),c_0_339])]),c_0_337]),c_0_336]) ).
cnf(c_0_346,negated_conjecture,
( is_eventually_in(esk35_0,esk36_0,esk37_0)
| in(esk37_0,filter_of_net_str(esk35_0,esk36_0)) ),
i_0_315 ).
cnf(c_0_347,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(X3,a_2_1_yellow19(X2,X1))
| X4 != X3
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ is_eventually_in(X2,X1,X4)
| ~ element(X4,powerset(the_carrier(X2))) ),
i_0_169 ).
cnf(c_0_348,negated_conjecture,
( ~ in(esk37_0,filter_of_net_str(esk35_0,esk36_0))
| ~ is_eventually_in(esk35_0,esk36_0,esk37_0) ),
inference(spm,[status(thm)],[c_0_343,c_0_344]) ).
cnf(c_0_349,negated_conjecture,
is_eventually_in(esk35_0,esk36_0,esk37_0),
inference(spm,[status(thm)],[c_0_345,c_0_346]) ).
cnf(c_0_350,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(X3,a_2_1_yellow19(X1,X2))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ element(X3,powerset(the_carrier(X1)))
| ~ is_eventually_in(X1,X2,X3) ),
inference(er,[status(thm)],[c_0_347]) ).
cnf(c_0_351,negated_conjecture,
( element(esk37_0,powerset(the_carrier(esk35_0)))
| in(esk37_0,filter_of_net_str(esk35_0,esk36_0)) ),
i_0_314 ).
cnf(c_0_352,negated_conjecture,
~ in(esk37_0,filter_of_net_str(esk35_0,esk36_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_348,c_0_349])]) ).
cnf(c_0_353,negated_conjecture,
( in(X1,filter_of_net_str(esk35_0,esk36_0))
| ~ element(X1,powerset(the_carrier(esk35_0)))
| ~ is_eventually_in(esk35_0,esk36_0,X1) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_350,c_0_339]),c_0_335]),c_0_334])]),c_0_336]),c_0_337]) ).
cnf(c_0_354,negated_conjecture,
element(esk37_0,powerset(the_carrier(esk35_0))),
inference(sr,[status(thm)],[c_0_351,c_0_352]) ).
cnf(c_0_355,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_353,c_0_354]),c_0_349])]),c_0_352]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU391+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n028.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jun 20 01:40:47 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.55/2.45 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.55/2.45 # No SInE strategy applied
% 8.55/2.45 # Trying AutoSched0 for 150 seconds
% 8.55/2.45 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_RG_S04BN
% 8.55/2.45 # and selection function PSelectComplexExceptUniqMaxHorn.
% 8.55/2.45 #
% 8.55/2.45 # Preprocessing time : 0.025 s
% 8.55/2.45
% 8.55/2.45 # Proof found!
% 8.55/2.45 # SZS status Theorem
% 8.55/2.45 # SZS output start CNFRefutation
% See solution above
% 8.55/2.45 # Training examples: 0 positive, 0 negative
% 8.55/2.45
% 8.55/2.45 # -------------------------------------------------
% 8.55/2.45 # User time : 0.029 s
% 8.55/2.45 # System time : 0.010 s
% 8.55/2.45 # Total time : 0.038 s
% 8.55/2.45 # Maximum resident set size: 7124 pages
% 8.55/2.45
%------------------------------------------------------------------------------