%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU112+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:38:31 EDT 2022
% Result : Theorem 7.94s 2.39s
% Output : CNFRefutation 7.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 11 unt; 0 nHn; 8 RR)
% Number of literals : 23 ( 2 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_57,plain,
( subset(finite_subsets(X1),finite_subsets(X2))
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-570u7n9c/lgb.p',i_0_57) ).
cnf(i_0_66,plain,
subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-570u7n9c/lgb.p',i_0_66) ).
cnf(i_0_68,plain,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-570u7n9c/lgb.p',i_0_68) ).
cnf(i_0_8,plain,
set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-570u7n9c/lgb.p',i_0_8) ).
cnf(i_0_58,negated_conjecture,
~ subset(set_union2(finite_subsets(esk11_0),finite_subsets(esk12_0)),finite_subsets(set_union2(esk11_0,esk12_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-570u7n9c/lgb.p',i_0_58) ).
cnf(c_0_74,plain,
( subset(finite_subsets(X1),finite_subsets(X2))
| ~ subset(X1,X2) ),
i_0_57 ).
cnf(c_0_75,plain,
subset(X1,set_union2(X1,X2)),
i_0_66 ).
cnf(c_0_76,plain,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
i_0_68 ).
cnf(c_0_77,plain,
subset(finite_subsets(X1),finite_subsets(set_union2(X1,X2))),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_78,plain,
set_union2(X1,X2) = set_union2(X2,X1),
i_0_8 ).
cnf(c_0_79,plain,
( subset(set_union2(X1,finite_subsets(X2)),finite_subsets(set_union2(X2,X3)))
| ~ subset(X1,finite_subsets(set_union2(X2,X3))) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_80,plain,
subset(finite_subsets(X1),finite_subsets(set_union2(X2,X1))),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_81,plain,
subset(set_union2(finite_subsets(X1),finite_subsets(X2)),finite_subsets(set_union2(X2,X1))),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_82,negated_conjecture,
~ subset(set_union2(finite_subsets(esk11_0),finite_subsets(esk12_0)),finite_subsets(set_union2(esk11_0,esk12_0))),
i_0_58 ).
cnf(c_0_83,plain,
subset(set_union2(finite_subsets(X1),finite_subsets(X2)),finite_subsets(set_union2(X1,X2))),
inference(spm,[status(thm)],[c_0_81,c_0_78]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_83])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SEU112+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 11:29:19 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 7.94/2.39 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.94/2.39 # No SInE strategy applied
% 7.94/2.39 # Trying AutoSched0 for 150 seconds
% 7.94/2.39 # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S083N
% 7.94/2.39 # and selection function SelectCQArNT.
% 7.94/2.39 #
% 7.94/2.39 # Preprocessing time : 0.023 s
% 7.94/2.39 # Presaturation interreduction done
% 7.94/2.39
% 7.94/2.39 # Proof found!
% 7.94/2.39 # SZS status Theorem
% 7.94/2.39 # SZS output start CNFRefutation
% See solution above
% 7.94/2.39 # Training examples: 0 positive, 0 negative
% 7.94/2.39
% 7.94/2.39 # -------------------------------------------------
% 7.94/2.39 # User time : 0.050 s
% 7.94/2.39 # System time : 0.008 s
% 7.94/2.39 # Total time : 0.058 s
% 7.94/2.39 # Maximum resident set size: 7124 pages
% 7.94/2.39
%------------------------------------------------------------------------------