TSTP Solution File: SET941+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET941+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:25 EDT 2022
% Result : Theorem 7.08s 2.33s
% Output : CNFRefutation 7.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 3 unt; 7 nHn; 16 RR)
% Number of literals : 48 ( 4 equ; 21 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
( in(esk2_3(X1,X2,X3),X1)
| X2 != union(X1)
| ~ in(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u3rp66pz/lgb.p',i_0_9) ).
cnf(i_0_3,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u3rp66pz/lgb.p',i_0_3) ).
cnf(i_0_15,negated_conjecture,
( subset(X1,esk8_0)
| ~ in(X1,esk7_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u3rp66pz/lgb.p',i_0_15) ).
cnf(i_0_10,plain,
( in(X1,esk2_3(X2,X3,X1))
| X3 != union(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u3rp66pz/lgb.p',i_0_10) ).
cnf(i_0_4,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u3rp66pz/lgb.p',i_0_4) ).
cnf(i_0_2,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u3rp66pz/lgb.p',i_0_2) ).
cnf(i_0_14,negated_conjecture,
~ subset(union(esk7_0),esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u3rp66pz/lgb.p',i_0_14) ).
cnf(c_0_23,plain,
( in(esk2_3(X1,X2,X3),X1)
| X2 != union(X1)
| ~ in(X3,X2) ),
i_0_9 ).
cnf(c_0_24,plain,
( in(esk2_3(X1,union(X1),X2),X1)
| ~ in(X2,union(X1)) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_25,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
i_0_3 ).
cnf(c_0_26,negated_conjecture,
( subset(X1,esk8_0)
| ~ in(X1,esk7_0) ),
i_0_15 ).
cnf(c_0_27,plain,
( in(esk2_3(X1,union(X1),esk1_2(union(X1),X2)),X1)
| subset(union(X1),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( in(X1,esk2_3(X2,X3,X1))
| X3 != union(X2)
| ~ in(X1,X3) ),
i_0_10 ).
cnf(c_0_29,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_4 ).
cnf(c_0_30,negated_conjecture,
( subset(esk2_3(esk7_0,union(esk7_0),esk1_2(union(esk7_0),X1)),esk8_0)
| subset(union(esk7_0),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( in(X1,esk2_3(X2,union(X2),X1))
| ~ in(X1,union(X2)) ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_32,plain,
( in(X1,esk8_0)
| subset(union(esk7_0),X2)
| ~ in(X1,esk2_3(esk7_0,union(esk7_0),esk1_2(union(esk7_0),X2))) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
( in(esk1_2(union(X1),X2),esk2_3(X1,union(X1),esk1_2(union(X1),X2)))
| subset(union(X1),X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_25]) ).
cnf(c_0_34,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
i_0_2 ).
cnf(c_0_35,plain,
( in(esk1_2(union(esk7_0),X1),esk8_0)
| subset(union(esk7_0),X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
~ subset(union(esk7_0),esk8_0),
i_0_14 ).
cnf(c_0_37,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET941+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jul 9 19:14:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.08/2.33 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.08/2.33 # No SInE strategy applied
% 7.08/2.33 # Trying AutoSched0 for 150 seconds
% 7.08/2.33 # AutoSched0-Mode selected heuristic H_____047_C18_F1_PI_AE_R8_CS_SP_S2S
% 7.08/2.33 # and selection function SelectNewComplexAHP.
% 7.08/2.33 #
% 7.08/2.33 # Preprocessing time : 0.023 s
% 7.08/2.33
% 7.08/2.33 # Proof found!
% 7.08/2.33 # SZS status Theorem
% 7.08/2.33 # SZS output start CNFRefutation
% See solution above
% 7.08/2.33 # Training examples: 0 positive, 0 negative
% 7.08/2.33
% 7.08/2.33 # -------------------------------------------------
% 7.08/2.33 # User time : 0.029 s
% 7.08/2.33 # System time : 0.004 s
% 7.08/2.33 # Total time : 0.033 s
% 7.08/2.33 # Maximum resident set size: 7124 pages
% 7.08/2.33
%------------------------------------------------------------------------------