%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU153+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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 08:38:55 EDT 2022
% Result : Theorem 4.79s 2.24s
% Output : CNFRefutation 4.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 8 unt; 0 nHn; 14 RR)
% Number of literals : 26 ( 4 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 22 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_99,lemma,
( ~ in(X1,X2)
| ~ in(X1,X3)
| ~ disjoint(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bairgs48/lgb.p',i_0_99) ).
cnf(i_0_66,negated_conjecture,
in(esk9_0,esk10_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bairgs48/lgb.p',i_0_66) ).
cnf(i_0_22,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bairgs48/lgb.p',i_0_22) ).
cnf(i_0_79,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bairgs48/lgb.p',i_0_79) ).
cnf(i_0_67,negated_conjecture,
disjoint(unordered_pair(esk9_0,esk9_0),esk10_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bairgs48/lgb.p',i_0_67) ).
cnf(c_0_105,lemma,
( ~ in(X1,X2)
| ~ in(X1,X3)
| ~ disjoint(X3,X2) ),
i_0_99 ).
cnf(c_0_106,negated_conjecture,
in(esk9_0,esk10_0),
i_0_66 ).
cnf(c_0_107,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X4,X3) ),
i_0_22 ).
cnf(c_0_108,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
i_0_79 ).
cnf(c_0_109,negated_conjecture,
disjoint(unordered_pair(esk9_0,esk9_0),esk10_0),
i_0_67 ).
cnf(c_0_110,negated_conjecture,
( ~ in(esk9_0,X1)
| ~ disjoint(esk10_0,X1) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_111,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_107])]) ).
cnf(c_0_112,negated_conjecture,
disjoint(esk10_0,unordered_pair(esk9_0,esk9_0)),
inference(spm,[status(thm)],[c_0_108,c_0_109]) ).
cnf(c_0_113,negated_conjecture,
~ disjoint(esk10_0,unordered_pair(X1,esk9_0)),
inference(spm,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_114,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_112,c_0_113]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU153+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 15:12:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 4.79/2.24 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.79/2.24 # No SInE strategy applied
% 4.79/2.24 # Trying AutoSched0 for 150 seconds
% 4.79/2.24 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 4.79/2.24 # and selection function SelectComplexG.
% 4.79/2.24 #
% 4.79/2.24 # Preprocessing time : 0.024 s
% 4.79/2.24
% 4.79/2.24 # Proof found!
% 4.79/2.24 # SZS status Theorem
% 4.79/2.24 # SZS output start CNFRefutation
% See solution above
% 4.79/2.24 # Training examples: 0 positive, 0 negative
% 4.79/2.24
% 4.79/2.24 # -------------------------------------------------
% 4.79/2.24 # User time : 0.027 s
% 4.79/2.24 # System time : 0.009 s
% 4.79/2.24 # Total time : 0.036 s
% 4.79/2.24 # Maximum resident set size: 7128 pages
% 4.79/2.24
%------------------------------------------------------------------------------