%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU167+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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:39:06 EDT 2022
% Result : Theorem 7.80s 2.22s
% Output : CNFRefutation 7.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 7 unt; 0 nHn; 11 RR)
% Number of literals : 27 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z_rs84e8/input.p',i_0_8) ).
cnf(i_0_4,plain,
( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X2))
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z_rs84e8/input.p',i_0_4) ).
cnf(i_0_3,plain,
( subset(cartesian_product2(X1,X2),cartesian_product2(X1,X3))
| ~ subset(X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z_rs84e8/input.p',i_0_3) ).
cnf(i_0_5,negated_conjecture,
~ subset(cartesian_product2(esk1_0,esk3_0),cartesian_product2(esk2_0,esk4_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z_rs84e8/input.p',i_0_5) ).
cnf(i_0_7,negated_conjecture,
subset(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z_rs84e8/input.p',i_0_7) ).
cnf(i_0_6,negated_conjecture,
subset(esk3_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z_rs84e8/input.p',i_0_6) ).
cnf(c_0_15,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
i_0_8 ).
cnf(c_0_16,plain,
( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X2))
| ~ subset(X1,X3) ),
i_0_4 ).
cnf(c_0_17,plain,
( subset(X1,cartesian_product2(X2,X3))
| ~ subset(X1,cartesian_product2(X4,X3))
| ~ subset(X4,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
( subset(cartesian_product2(X1,X2),cartesian_product2(X1,X3))
| ~ subset(X2,X3) ),
i_0_3 ).
cnf(c_0_19,negated_conjecture,
~ subset(cartesian_product2(esk1_0,esk3_0),cartesian_product2(esk2_0,esk4_0)),
i_0_5 ).
cnf(c_0_20,plain,
( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ subset(X1,X3)
| ~ subset(X2,X4) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
subset(esk1_0,esk2_0),
i_0_7 ).
cnf(c_0_22,negated_conjecture,
subset(esk3_0,esk4_0),
i_0_6 ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU167+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n010.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 : Sat Jun 18 19:48:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.80/2.22 # ENIGMATIC: Solved by autoschedule:
% 7.80/2.22 # No SInE strategy applied
% 7.80/2.22 # Trying AutoSched0 for 150 seconds
% 7.80/2.22 # AutoSched0-Mode selected heuristic G_E___103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 7.80/2.22 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.80/2.22 #
% 7.80/2.22 # Preprocessing time : 0.020 s
% 7.80/2.22
% 7.80/2.22 # Proof found!
% 7.80/2.22 # SZS status Theorem
% 7.80/2.22 # SZS output start CNFRefutation
% See solution above
% 7.80/2.22 # Training examples: 0 positive, 0 negative
% 7.80/2.22
% 7.80/2.22 # -------------------------------------------------
% 7.80/2.22 # User time : 0.022 s
% 7.80/2.22 # System time : 0.006 s
% 7.80/2.22 # Total time : 0.027 s
% 7.80/2.22 # Maximum resident set size: 7120 pages
% 7.80/2.22
%------------------------------------------------------------------------------