TSTP Solution File: SET906+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET906+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:15:09 EDT 2022
% Result : Theorem 8.50s 2.49s
% Output : CNFRefutation 8.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 10 unt; 0 nHn; 13 RR)
% Number of literals : 32 ( 8 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_13,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-si4jzz4_/input.p',i_0_13) ).
cnf(i_0_8,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X3,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-si4jzz4_/input.p',i_0_8) ).
cnf(i_0_18,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-si4jzz4_/input.p',i_0_18) ).
cnf(i_0_26,negated_conjecture,
subset(set_union2(unordered_pair(esk6_0,esk7_0),esk8_0),esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-si4jzz4_/input.p',i_0_26) ).
cnf(i_0_3,plain,
set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-si4jzz4_/input.p',i_0_3) ).
cnf(i_0_25,negated_conjecture,
~ in(esk6_0,esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-si4jzz4_/input.p',i_0_25) ).
cnf(c_0_33,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X4) ),
i_0_13 ).
cnf(c_0_34,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X3,X4) ),
i_0_8 ).
cnf(c_0_35,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_36,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_34])]) ).
cnf(c_0_37,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_18 ).
cnf(c_0_38,plain,
in(X1,set_union2(X2,unordered_pair(X1,X3))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
subset(set_union2(unordered_pair(esk6_0,esk7_0),esk8_0),esk8_0),
i_0_26 ).
cnf(c_0_40,plain,
set_union2(X1,X2) = set_union2(X2,X1),
i_0_3 ).
cnf(c_0_41,plain,
( in(X1,X2)
| ~ subset(set_union2(X3,unordered_pair(X1,X4)),X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
subset(set_union2(esk8_0,unordered_pair(esk6_0,esk7_0)),esk8_0),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
~ in(esk6_0,esk8_0),
i_0_25 ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET906+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 22:06:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 8.50/2.49 # ENIGMATIC: Solved by autoschedule:
% 8.50/2.49 # No SInE strategy applied
% 8.50/2.49 # Trying AutoSched0 for 150 seconds
% 8.50/2.49 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S006A
% 8.50/2.49 # and selection function SelectLargestNegLit.
% 8.50/2.49 #
% 8.50/2.49 # Preprocessing time : 0.013 s
% 8.50/2.49 # Presaturation interreduction done
% 8.50/2.49
% 8.50/2.49 # Proof found!
% 8.50/2.49 # SZS status Theorem
% 8.50/2.49 # SZS output start CNFRefutation
% See solution above
% 8.50/2.49 # Training examples: 0 positive, 0 negative
% 8.50/2.49
% 8.50/2.49 # -------------------------------------------------
% 8.50/2.49 # User time : 0.018 s
% 8.50/2.49 # System time : 0.007 s
% 8.50/2.49 # Total time : 0.024 s
% 8.50/2.49 # Maximum resident set size: 7124 pages
% 8.50/2.49
%------------------------------------------------------------------------------