TSTP Solution File: SET185+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET185+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:15 EDT 2022
% Result : Theorem 7.91s 2.38s
% Output : CNFRefutation 7.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 11 unt; 4 nHn; 16 RR)
% Number of literals : 41 ( 9 equ; 17 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 : 31 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_16,negated_conjecture,
union(esk3_0,esk4_0) != esk4_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j2ty621v/input.p',i_0_16) ).
cnf(i_0_10,plain,
union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j2ty621v/input.p',i_0_10) ).
cnf(i_0_13,plain,
( X1 = X2
| ~ member(esk2_2(X1,X2),X2)
| ~ member(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j2ty621v/input.p',i_0_13) ).
cnf(i_0_2,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j2ty621v/input.p',i_0_2) ).
cnf(i_0_12,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j2ty621v/input.p',i_0_12) ).
cnf(i_0_6,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j2ty621v/input.p',i_0_6) ).
cnf(i_0_17,negated_conjecture,
subset(esk3_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j2ty621v/input.p',i_0_17) ).
cnf(i_0_3,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j2ty621v/input.p',i_0_3) ).
cnf(c_0_26,negated_conjecture,
union(esk3_0,esk4_0) != esk4_0,
i_0_16 ).
cnf(c_0_27,plain,
union(X1,X2) = union(X2,X1),
i_0_10 ).
cnf(c_0_28,negated_conjecture,
union(esk4_0,esk3_0) != esk4_0,
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
( X1 = X2
| ~ member(esk2_2(X1,X2),X2)
| ~ member(esk2_2(X1,X2),X1) ),
i_0_13 ).
cnf(c_0_30,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
i_0_2 ).
cnf(c_0_31,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
i_0_12 ).
cnf(c_0_32,negated_conjecture,
~ member(esk2_2(esk4_0,union(esk4_0,esk3_0)),esk4_0),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29])]),c_0_30]) ).
cnf(c_0_33,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
i_0_6 ).
cnf(c_0_34,negated_conjecture,
subset(esk3_0,esk4_0),
i_0_17 ).
cnf(c_0_35,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
i_0_3 ).
cnf(c_0_36,negated_conjecture,
member(esk2_2(esk4_0,union(esk4_0,esk3_0)),union(esk4_0,esk3_0)),
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_31])]),c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
member(esk2_2(esk4_0,union(esk4_0,esk3_0)),esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_32]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET185+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n011.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 : Sun Jul 10 10:37:13 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.91/2.38 # ENIGMATIC: Solved by autoschedule:
% 7.91/2.38 # No SInE strategy applied
% 7.91/2.38 # Trying AutoSched0 for 150 seconds
% 7.91/2.38 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04CA
% 7.91/2.38 # and selection function MSelectComplexExceptUniqMaxHorn.
% 7.91/2.38 #
% 7.91/2.38 # Preprocessing time : 0.012 s
% 7.91/2.38 # Presaturation interreduction done
% 7.91/2.38
% 7.91/2.38 # Proof found!
% 7.91/2.38 # SZS status Theorem
% 7.91/2.38 # SZS output start CNFRefutation
% See solution above
% 7.91/2.38 # Training examples: 0 positive, 0 negative
% 7.91/2.38
% 7.91/2.38 # -------------------------------------------------
% 7.91/2.38 # User time : 0.016 s
% 7.91/2.38 # System time : 0.006 s
% 7.91/2.38 # Total time : 0.022 s
% 7.91/2.38 # Maximum resident set size: 7120 pages
% 7.91/2.38
%------------------------------------------------------------------------------