TSTP Solution File: SEU307+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU307+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:40:38 EDT 2022
% Result : Theorem 8.63s 2.47s
% Output : CNFRefutation 8.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 9 unt; 0 nHn; 21 RR)
% Number of literals : 35 ( 12 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_115,negated_conjecture,
subset_intersection2(the_carrier(esk6_0),esk7_0,cast_as_carrier_subset(esk6_0)) != esk7_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xkygggm2/lgb.p',i_0_115) ).
cnf(i_0_103,plain,
( subset_intersection2(X1,X2,X3) = set_intersection2(X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xkygggm2/lgb.p',i_0_103) ).
cnf(i_0_116,negated_conjecture,
element(esk7_0,powerset(the_carrier(esk6_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xkygggm2/lgb.p',i_0_116) ).
cnf(i_0_105,plain,
( element(cast_as_carrier_subset(X1),powerset(the_carrier(X1)))
| ~ one_sorted_str(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xkygggm2/lgb.p',i_0_105) ).
cnf(i_0_117,negated_conjecture,
one_sorted_str(esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xkygggm2/lgb.p',i_0_117) ).
cnf(i_0_114,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xkygggm2/lgb.p',i_0_114) ).
cnf(i_0_118,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xkygggm2/lgb.p',i_0_118) ).
cnf(i_0_113,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xkygggm2/lgb.p',i_0_113) ).
cnf(c_0_127,negated_conjecture,
subset_intersection2(the_carrier(esk6_0),esk7_0,cast_as_carrier_subset(esk6_0)) != esk7_0,
i_0_115 ).
cnf(c_0_128,plain,
( subset_intersection2(X1,X2,X3) = set_intersection2(X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
i_0_103 ).
cnf(c_0_129,negated_conjecture,
element(esk7_0,powerset(the_carrier(esk6_0))),
i_0_116 ).
cnf(c_0_130,negated_conjecture,
( set_intersection2(esk7_0,cast_as_carrier_subset(esk6_0)) != esk7_0
| ~ element(cast_as_carrier_subset(esk6_0),powerset(the_carrier(esk6_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_129])]) ).
cnf(c_0_131,plain,
( element(cast_as_carrier_subset(X1),powerset(the_carrier(X1)))
| ~ one_sorted_str(X1) ),
i_0_105 ).
cnf(c_0_132,negated_conjecture,
one_sorted_str(esk6_0),
i_0_117 ).
cnf(c_0_133,plain,
set_intersection2(esk7_0,cast_as_carrier_subset(esk6_0)) != esk7_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_132])]) ).
cnf(c_0_134,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
i_0_114 ).
cnf(c_0_135,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
i_0_118 ).
cnf(c_0_136,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
i_0_113 ).
cnf(c_0_137,plain,
set_intersection2(esk7_0,the_carrier(esk6_0)) != esk7_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_134]),c_0_132])]) ).
cnf(c_0_138,plain,
( set_intersection2(X1,X2) = X1
| ~ element(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_135,c_0_136]) ).
cnf(c_0_139,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_129])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU307+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n007.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 : Sun Jun 19 10:35:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 8.63/2.47 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.63/2.47 # No SInE strategy applied
% 8.63/2.47 # Trying AutoSched0 for 150 seconds
% 8.63/2.47 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 8.63/2.47 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.63/2.47 #
% 8.63/2.47 # Preprocessing time : 0.023 s
% 8.63/2.47 # Presaturation interreduction done
% 8.63/2.47
% 8.63/2.47 # Proof found!
% 8.63/2.47 # SZS status Theorem
% 8.63/2.47 # SZS output start CNFRefutation
% See solution above
% 8.63/2.47 # Training examples: 0 positive, 0 negative
% 8.63/2.47
% 8.63/2.47 # -------------------------------------------------
% 8.63/2.47 # User time : 0.025 s
% 8.63/2.47 # System time : 0.008 s
% 8.63/2.47 # Total time : 0.033 s
% 8.63/2.47 # Maximum resident set size: 7120 pages
% 8.63/2.47
%------------------------------------------------------------------------------