TSTP Solution File: SET162+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET162+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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 00:10:02 EDT 2022
% Result : Theorem 7.67s 2.36s
% Output : CNFRefutation 7.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 12 unt; 6 nHn; 13 RR)
% Number of literals : 43 ( 9 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 43 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y5ve84h9/input.p',i_0_3) ).
cnf(i_0_10,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y5ve84h9/input.p',i_0_10) ).
cnf(i_0_4,plain,
~ member(X1,empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y5ve84h9/input.p',i_0_4) ).
cnf(i_0_9,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y5ve84h9/input.p',i_0_9) ).
cnf(i_0_2,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y5ve84h9/input.p',i_0_2) ).
cnf(i_0_5,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y5ve84h9/input.p',i_0_5) ).
cnf(i_0_19,negated_conjecture,
union(esk4_0,empty_set) != esk4_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y5ve84h9/input.p',i_0_19) ).
cnf(i_0_8,plain,
union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y5ve84h9/input.p',i_0_8) ).
cnf(c_0_28,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
i_0_3 ).
cnf(c_0_29,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
i_0_10 ).
cnf(c_0_30,plain,
~ member(X1,empty_set),
i_0_4 ).
cnf(c_0_31,plain,
( member(esk1_2(union(X1,X2),X3),X1)
| member(esk1_2(union(X1,X2),X3),X2)
| subset(union(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
i_0_9 ).
cnf(c_0_33,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
i_0_2 ).
cnf(c_0_34,plain,
( member(esk1_2(union(X1,empty_set),X2),X1)
| subset(union(X1,empty_set),X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( subset(X1,union(X2,X3))
| ~ member(esk1_2(X1,union(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_5 ).
cnf(c_0_37,plain,
subset(union(X1,empty_set),X1),
inference(spm,[status(thm)],[c_0_32,c_0_34]) ).
cnf(c_0_38,plain,
subset(X1,union(X1,X2)),
inference(spm,[status(thm)],[c_0_35,c_0_29]) ).
cnf(c_0_39,negated_conjecture,
union(esk4_0,empty_set) != esk4_0,
i_0_19 ).
cnf(c_0_40,plain,
union(X1,X2) = union(X2,X1),
i_0_8 ).
cnf(c_0_41,plain,
union(X1,empty_set) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_42,negated_conjecture,
union(empty_set,esk4_0) != esk4_0,
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
union(empty_set,X1) = X1,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET162+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 02:42:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.67/2.36 # ENIGMATIC: Solved by autoschedule:
% 7.67/2.36 # No SInE strategy applied
% 7.67/2.36 # Trying AutoSched0 for 150 seconds
% 7.67/2.36 # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 7.67/2.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.67/2.36 #
% 7.67/2.36 # Preprocessing time : 0.014 s
% 7.67/2.36
% 7.67/2.36 # Proof found!
% 7.67/2.36 # SZS status Theorem
% 7.67/2.36 # SZS output start CNFRefutation
% See solution above
% 7.67/2.36 # Training examples: 0 positive, 0 negative
% 7.67/2.36
% 7.67/2.36 # -------------------------------------------------
% 7.67/2.36 # User time : 0.054 s
% 7.67/2.36 # System time : 0.003 s
% 7.67/2.36 # Total time : 0.057 s
% 7.67/2.36 # Maximum resident set size: 7124 pages
% 7.67/2.36
%------------------------------------------------------------------------------