%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU308+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:39 EDT 2022
% Result : Theorem 7.97s 2.31s
% Output : CNFRefutation 7.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 20 ( 12 unt; 0 nHn; 17 RR)
% Number of literals : 30 ( 10 equ; 14 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 : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_99,negated_conjecture,
subset_difference(the_carrier(esk6_0),cast_as_carrier_subset(esk6_0),esk7_0) != subset_complement(the_carrier(esk6_0),esk7_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6tj16td9/lgb.p',i_0_99) ).
cnf(i_0_98,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6tj16td9/lgb.p',i_0_98) ).
cnf(i_0_101,negated_conjecture,
one_sorted_str(esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6tj16td9/lgb.p',i_0_101) ).
cnf(i_0_96,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6tj16td9/lgb.p',i_0_96) ).
cnf(i_0_69,plain,
subset(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6tj16td9/lgb.p',i_0_69) ).
cnf(i_0_86,plain,
( subset_difference(X1,X2,X3) = set_difference(X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6tj16td9/lgb.p',i_0_86) ).
cnf(i_0_100,negated_conjecture,
element(esk7_0,powerset(the_carrier(esk6_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6tj16td9/lgb.p',i_0_100) ).
cnf(i_0_102,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6tj16td9/lgb.p',i_0_102) ).
cnf(c_0_111,negated_conjecture,
subset_difference(the_carrier(esk6_0),cast_as_carrier_subset(esk6_0),esk7_0) != subset_complement(the_carrier(esk6_0),esk7_0),
i_0_99 ).
cnf(c_0_112,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
i_0_98 ).
cnf(c_0_113,negated_conjecture,
one_sorted_str(esk6_0),
i_0_101 ).
cnf(c_0_114,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
i_0_96 ).
cnf(c_0_115,plain,
subset(X1,X1),
i_0_69 ).
cnf(c_0_116,negated_conjecture,
subset_difference(the_carrier(esk6_0),the_carrier(esk6_0),esk7_0) != subset_complement(the_carrier(esk6_0),esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_113])]) ).
cnf(c_0_117,plain,
( subset_difference(X1,X2,X3) = set_difference(X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
i_0_86 ).
cnf(c_0_118,negated_conjecture,
element(esk7_0,powerset(the_carrier(esk6_0))),
i_0_100 ).
cnf(c_0_119,plain,
element(X1,powerset(X1)),
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_120,negated_conjecture,
set_difference(the_carrier(esk6_0),esk7_0) != subset_complement(the_carrier(esk6_0),esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_118]),c_0_119])]) ).
cnf(c_0_121,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
i_0_102 ).
cnf(c_0_122,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_118])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU308+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n013.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 : Sun Jun 19 01:32:46 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.97/2.31 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.97/2.31 # No SInE strategy applied
% 7.97/2.31 # Trying AutoSched0 for 150 seconds
% 7.97/2.31 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.97/2.31 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.97/2.31 #
% 7.97/2.31 # Preprocessing time : 0.023 s
% 7.97/2.31 # Presaturation interreduction done
% 7.97/2.31
% 7.97/2.31 # Proof found!
% 7.97/2.31 # SZS status Theorem
% 7.97/2.31 # SZS output start CNFRefutation
% See solution above
% 7.97/2.31 # Training examples: 0 positive, 0 negative
% 7.97/2.31
% 7.97/2.31 # -------------------------------------------------
% 7.97/2.31 # User time : 0.024 s
% 7.97/2.31 # System time : 0.009 s
% 7.97/2.31 # Total time : 0.034 s
% 7.97/2.31 # Maximum resident set size: 7124 pages
% 7.97/2.31
%------------------------------------------------------------------------------