TSTP Solution File: SET942+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET942+1 : TPTP v8.1.0. Released v3.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:15:26 EDT 2022
% Result : Theorem 7.85s 2.37s
% Output : CNFRefutation 7.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 5 unt; 4 nHn; 21 RR)
% Number of literals : 59 ( 7 equ; 33 neg)
% Maximal clause size : 4 ( 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 : 48 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( in(X1,X2)
| X2 != union(X3)
| ~ in(X4,X3)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2enz4dhc/lgb.p',i_0_8) ).
cnf(i_0_4,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2enz4dhc/lgb.p',i_0_4) ).
cnf(i_0_15,negated_conjecture,
subset(esk7_0,esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2enz4dhc/lgb.p',i_0_15) ).
cnf(i_0_9,plain,
( in(esk2_3(X1,X2,X3),X1)
| X2 != union(X1)
| ~ in(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2enz4dhc/lgb.p',i_0_9) ).
cnf(i_0_3,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2enz4dhc/lgb.p',i_0_3) ).
cnf(i_0_10,plain,
( in(X1,esk2_3(X2,X3,X1))
| X3 != union(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2enz4dhc/lgb.p',i_0_10) ).
cnf(i_0_2,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2enz4dhc/lgb.p',i_0_2) ).
cnf(i_0_14,negated_conjecture,
~ subset(union(esk7_0),union(esk8_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2enz4dhc/lgb.p',i_0_14) ).
cnf(c_0_24,plain,
( in(X1,X2)
| X2 != union(X3)
| ~ in(X4,X3)
| ~ in(X1,X4) ),
i_0_8 ).
cnf(c_0_25,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_4 ).
cnf(c_0_26,negated_conjecture,
subset(esk7_0,esk8_0),
i_0_15 ).
cnf(c_0_27,plain,
( in(X1,union(X2))
| ~ in(X3,X2)
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( in(X1,esk8_0)
| ~ in(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( in(X1,union(esk8_0))
| ~ in(X2,esk7_0)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,plain,
( in(esk2_3(X1,X2,X3),X1)
| X2 != union(X1)
| ~ in(X3,X2) ),
i_0_9 ).
cnf(c_0_31,plain,
( in(X1,union(esk8_0))
| X2 != union(esk7_0)
| ~ in(X1,esk2_3(esk7_0,X2,X3))
| ~ in(X3,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,plain,
( in(X1,union(esk8_0))
| ~ in(X1,esk2_3(esk7_0,union(esk7_0),X2))
| ~ in(X2,union(esk7_0)) ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_33,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
i_0_3 ).
cnf(c_0_34,plain,
( in(X1,union(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_32,c_0_33]) ).
cnf(c_0_35,plain,
( in(X1,esk2_3(X2,X3,X1))
| X3 != union(X2)
| ~ in(X1,X3) ),
i_0_10 ).
cnf(c_0_36,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
i_0_2 ).
cnf(c_0_37,plain,
( in(esk1_2(union(esk7_0),X1),union(esk8_0))
| subset(union(esk7_0),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_33]) ).
cnf(c_0_38,negated_conjecture,
~ subset(union(esk7_0),union(esk8_0)),
i_0_14 ).
cnf(c_0_39,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET942+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n004.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun Jul 10 20:15:24 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 7.85/2.37 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.85/2.37 # No SInE strategy applied
% 7.85/2.37 # Trying AutoSched0 for 150 seconds
% 7.85/2.37 # AutoSched0-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S070I
% 7.85/2.37 # and selection function SelectVGNonCR.
% 7.85/2.37 #
% 7.85/2.37 # Preprocessing time : 0.012 s
% 7.85/2.37 # Presaturation interreduction done
% 7.85/2.37
% 7.85/2.37 # Proof found!
% 7.85/2.37 # SZS status Theorem
% 7.85/2.37 # SZS output start CNFRefutation
% See solution above
% 7.85/2.37 # Training examples: 0 positive, 0 negative
% 7.85/2.37
% 7.85/2.37 # -------------------------------------------------
% 7.85/2.37 # User time : 0.015 s
% 7.85/2.37 # System time : 0.002 s
% 7.85/2.37 # Total time : 0.017 s
% 7.85/2.37 # Maximum resident set size: 7120 pages
% 7.85/2.37
%------------------------------------------------------------------------------