TSTP Solution File: SET929+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET929+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:21 EDT 2022
% Result : Theorem 8.31s 2.36s
% Output : CNFRefutation 8.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 6 unt; 4 nHn; 22 RR)
% Number of literals : 47 ( 17 equ; 23 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 33 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_10,plain,
( in(X1,X2)
| ~ subset(unordered_pair(X3,X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1onhkw8/lgb.p',i_0_10) ).
cnf(i_0_8,plain,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1onhkw8/lgb.p',i_0_8) ).
cnf(i_0_12,negated_conjecture,
( set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) = empty_set
| in(esk4_0,esk5_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1onhkw8/lgb.p',i_0_12) ).
cnf(i_0_2,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1onhkw8/lgb.p',i_0_2) ).
cnf(i_0_14,negated_conjecture,
( set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != empty_set
| ~ in(esk3_0,esk5_0)
| ~ in(esk4_0,esk5_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1onhkw8/lgb.p',i_0_14) ).
cnf(i_0_13,negated_conjecture,
( set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) = empty_set
| in(esk3_0,esk5_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1onhkw8/lgb.p',i_0_13) ).
cnf(i_0_7,plain,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1onhkw8/lgb.p',i_0_7) ).
cnf(i_0_9,plain,
( subset(unordered_pair(X1,X2),X3)
| ~ in(X2,X3)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-o1onhkw8/lgb.p',i_0_9) ).
cnf(c_0_23,plain,
( in(X1,X2)
| ~ subset(unordered_pair(X3,X1),X2) ),
i_0_10 ).
cnf(c_0_24,plain,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
i_0_8 ).
cnf(c_0_25,plain,
( in(X1,X2)
| set_difference(unordered_pair(X3,X1),X2) != empty_set ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) = empty_set
| in(esk4_0,esk5_0) ),
i_0_12 ).
cnf(c_0_27,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_2 ).
cnf(c_0_28,negated_conjecture,
( set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != empty_set
| ~ in(esk3_0,esk5_0)
| ~ in(esk4_0,esk5_0) ),
i_0_14 ).
cnf(c_0_29,negated_conjecture,
in(esk4_0,esk5_0),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( in(X1,X2)
| set_difference(unordered_pair(X1,X3),X2) != empty_set ),
inference(spm,[status(thm)],[c_0_25,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) = empty_set
| in(esk3_0,esk5_0) ),
i_0_13 ).
cnf(c_0_32,negated_conjecture,
( set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != empty_set
| ~ in(esk3_0,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_33,negated_conjecture,
in(esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
i_0_7 ).
cnf(c_0_35,plain,
( subset(unordered_pair(X1,X2),X3)
| ~ in(X2,X3)
| ~ in(X1,X3) ),
i_0_9 ).
cnf(c_0_36,negated_conjecture,
set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_37,plain,
( set_difference(unordered_pair(X1,X2),X3) = empty_set
| ~ in(X2,X3)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_29]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET929+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jul 9 21:55:02 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected complete mode:
% 8.31/2.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.31/2.36 # No SInE strategy applied
% 8.31/2.36 # Trying AutoSched0 for 150 seconds
% 8.31/2.36 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.31/2.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.31/2.36 #
% 8.31/2.36 # Preprocessing time : 0.013 s
% 8.31/2.36 # Presaturation interreduction done
% 8.31/2.36
% 8.31/2.36 # Proof found!
% 8.31/2.36 # SZS status Theorem
% 8.31/2.36 # SZS output start CNFRefutation
% See solution above
% 8.31/2.36 # Training examples: 0 positive, 0 negative
% 8.31/2.36
% 8.31/2.36 # -------------------------------------------------
% 8.31/2.36 # User time : 0.015 s
% 8.31/2.36 # System time : 0.005 s
% 8.31/2.36 # Total time : 0.020 s
% 8.31/2.36 # Maximum resident set size: 7120 pages
% 8.31/2.36
%------------------------------------------------------------------------------