TSTP Solution File: SEU132+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU132+2 : 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:38:41 EDT 2022
% Result : Theorem 10.81s 2.80s
% Output : CNFRefutation 10.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 10 unt; 5 nHn; 23 RR)
% Number of literals : 53 ( 6 equ; 30 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_28,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-drc3iqsw/input.p',i_0_28) ).
cnf(i_0_58,negated_conjecture,
~ subset(set_difference(esk9_0,esk11_0),set_difference(esk10_0,esk11_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-drc3iqsw/input.p',i_0_58) ).
cnf(i_0_16,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-drc3iqsw/input.p',i_0_16) ).
cnf(i_0_15,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-drc3iqsw/input.p',i_0_15) ).
cnf(i_0_27,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-drc3iqsw/input.p',i_0_27) ).
cnf(i_0_29,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-drc3iqsw/input.p',i_0_29) ).
cnf(i_0_17,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-drc3iqsw/input.p',i_0_17) ).
cnf(i_0_59,negated_conjecture,
subset(esk9_0,esk10_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-drc3iqsw/input.p',i_0_59) ).
cnf(c_0_68,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
i_0_28 ).
cnf(c_0_69,negated_conjecture,
~ subset(set_difference(esk9_0,esk11_0),set_difference(esk10_0,esk11_0)),
i_0_58 ).
cnf(c_0_70,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
i_0_16 ).
cnf(c_0_71,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
i_0_15 ).
cnf(c_0_72,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
i_0_27 ).
cnf(c_0_73,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_68]) ).
cnf(c_0_74,negated_conjecture,
in(esk3_2(set_difference(esk9_0,esk11_0),set_difference(esk10_0,esk11_0)),set_difference(esk9_0,esk11_0)),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_75,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
i_0_29 ).
cnf(c_0_76,negated_conjecture,
~ in(esk3_2(set_difference(esk9_0,esk11_0),set_difference(esk10_0,esk11_0)),set_difference(esk10_0,esk11_0)),
inference(spm,[status(thm)],[c_0_69,c_0_71]) ).
cnf(c_0_77,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_72]) ).
cnf(c_0_78,plain,
~ in(esk3_2(set_difference(esk9_0,esk11_0),set_difference(esk10_0,esk11_0)),esk11_0),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_79,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_17 ).
cnf(c_0_80,negated_conjecture,
subset(esk9_0,esk10_0),
i_0_59 ).
cnf(c_0_81,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_75]) ).
cnf(c_0_82,plain,
~ in(esk3_2(set_difference(esk9_0,esk11_0),set_difference(esk10_0,esk11_0)),esk10_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]) ).
cnf(c_0_83,negated_conjecture,
( in(X1,esk10_0)
| ~ in(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_84,plain,
in(esk3_2(set_difference(esk9_0,esk11_0),set_difference(esk10_0,esk11_0)),esk9_0),
inference(spm,[status(thm)],[c_0_81,c_0_74]) ).
cnf(c_0_85,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SEU132+2 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.36 % Computer : n013.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sat Jun 18 20:54:45 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected complete mode:
% 10.81/2.80 # ENIGMATIC: Solved by autoschedule:
% 10.81/2.80 # No SInE strategy applied
% 10.81/2.80 # Trying AutoSched0 for 150 seconds
% 10.81/2.80 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 10.81/2.80 # and selection function SelectMaxLComplexAvoidPosPred.
% 10.81/2.80 #
% 10.81/2.80 # Preprocessing time : 0.014 s
% 10.81/2.80 # Presaturation interreduction done
% 10.81/2.80
% 10.81/2.80 # Proof found!
% 10.81/2.80 # SZS status Theorem
% 10.81/2.80 # SZS output start CNFRefutation
% See solution above
% 10.81/2.80 # Training examples: 0 positive, 0 negative
% 10.81/2.80
% 10.81/2.80 # -------------------------------------------------
% 10.81/2.80 # User time : 0.025 s
% 10.81/2.80 # System time : 0.006 s
% 10.81/2.80 # Total time : 0.031 s
% 10.81/2.80 # Maximum resident set size: 7124 pages
% 10.81/2.80
%------------------------------------------------------------------------------