TSTP Solution File: SEU167+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU167+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:07 EDT 2022
% Result : Theorem 7.82s 2.38s
% Output : CNFRefutation 7.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 10 unt; 0 nHn; 11 RR)
% Number of literals : 26 ( 0 equ; 13 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 : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,negated_conjecture,
~ subset(cartesian_product2(esk3_0,esk5_0),cartesian_product2(esk4_0,esk6_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0i5by070/input.p',i_0_6) ).
cnf(i_0_9,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0i5by070/input.p',i_0_9) ).
cnf(i_0_5,plain,
( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X2))
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0i5by070/input.p',i_0_5) ).
cnf(i_0_8,negated_conjecture,
subset(esk3_0,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0i5by070/input.p',i_0_8) ).
cnf(i_0_4,plain,
( subset(cartesian_product2(X1,X2),cartesian_product2(X1,X3))
| ~ subset(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0i5by070/input.p',i_0_4) ).
cnf(i_0_7,negated_conjecture,
subset(esk5_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0i5by070/input.p',i_0_7) ).
cnf(c_0_16,negated_conjecture,
~ subset(cartesian_product2(esk3_0,esk5_0),cartesian_product2(esk4_0,esk6_0)),
i_0_6 ).
cnf(c_0_17,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
i_0_9 ).
cnf(c_0_18,plain,
( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X2))
| ~ subset(X1,X3) ),
i_0_5 ).
cnf(c_0_19,negated_conjecture,
subset(esk3_0,esk4_0),
i_0_8 ).
cnf(c_0_20,negated_conjecture,
( ~ subset(X1,cartesian_product2(esk4_0,esk6_0))
| ~ subset(cartesian_product2(esk3_0,esk5_0),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
subset(cartesian_product2(esk3_0,X1),cartesian_product2(esk4_0,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( subset(cartesian_product2(X1,X2),cartesian_product2(X1,X3))
| ~ subset(X2,X3) ),
i_0_4 ).
cnf(c_0_23,negated_conjecture,
subset(esk5_0,esk6_0),
i_0_7 ).
cnf(c_0_24,negated_conjecture,
~ subset(cartesian_product2(esk3_0,esk5_0),cartesian_product2(esk3_0,esk6_0)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
subset(cartesian_product2(X1,esk5_0),cartesian_product2(X1,esk6_0)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU167+3 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.35 % Computer : n012.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Sun Jun 19 07:09:24 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected complete mode:
% 7.82/2.38 # ENIGMATIC: Solved by autoschedule:
% 7.82/2.38 # No SInE strategy applied
% 7.82/2.38 # Trying AutoSched0 for 150 seconds
% 7.82/2.38 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S02FN
% 7.82/2.38 # and selection function PSelectNonAntiRROptimalLit.
% 7.82/2.38 #
% 7.82/2.38 # Preprocessing time : 0.014 s
% 7.82/2.38 # Presaturation interreduction done
% 7.82/2.38
% 7.82/2.38 # Proof found!
% 7.82/2.38 # SZS status Theorem
% 7.82/2.38 # SZS output start CNFRefutation
% See solution above
% 7.82/2.38 # Training examples: 0 positive, 0 negative
% 7.82/2.38
% 7.82/2.38 # -------------------------------------------------
% 7.82/2.38 # User time : 0.016 s
% 7.82/2.38 # System time : 0.005 s
% 7.82/2.38 # Total time : 0.021 s
% 7.82/2.38 # Maximum resident set size: 7120 pages
% 7.82/2.38
%------------------------------------------------------------------------------