TSTP Solution File: SEU148+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU148+2 : TPTP v8.1.0. Released v3.3.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 08:38:51 EDT 2022
% Result : Theorem 4.83s 2.27s
% Output : CNFRefutation 4.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 6 unt; 0 nHn; 11 RR)
% Number of literals : 18 ( 7 equ; 9 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 : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
( X1 = X2
| X3 != unordered_pair(X2,X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-od0mmjo_/lgb.p',i_0_12) ).
cnf(i_0_66,lemma,
( in(X1,X2)
| ~ subset(unordered_pair(X1,X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-od0mmjo_/lgb.p',i_0_66) ).
cnf(i_0_110,negated_conjecture,
subset(unordered_pair(esk14_0,esk14_0),unordered_pair(esk15_0,esk15_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-od0mmjo_/lgb.p',i_0_110) ).
cnf(i_0_109,negated_conjecture,
esk15_0 != esk14_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-od0mmjo_/lgb.p',i_0_109) ).
cnf(c_0_115,plain,
( X1 = X2
| X3 != unordered_pair(X2,X2)
| ~ in(X1,X3) ),
i_0_12 ).
cnf(c_0_116,lemma,
( in(X1,X2)
| ~ subset(unordered_pair(X1,X1),X2) ),
i_0_66 ).
cnf(c_0_117,negated_conjecture,
subset(unordered_pair(esk14_0,esk14_0),unordered_pair(esk15_0,esk15_0)),
i_0_110 ).
cnf(c_0_118,plain,
( X1 = X2
| ~ in(X1,unordered_pair(X2,X2)) ),
inference(er,[status(thm)],[c_0_115]) ).
cnf(c_0_119,negated_conjecture,
in(esk14_0,unordered_pair(esk15_0,esk15_0)),
inference(spm,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_120,negated_conjecture,
esk15_0 != esk14_0,
i_0_109 ).
cnf(c_0_121,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_120]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU148+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n024.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 : Mon Jun 20 10:04:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 4.83/2.27 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.83/2.27 # No SInE strategy applied
% 4.83/2.27 # Trying AutoSched0 for 150 seconds
% 4.83/2.27 # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I
% 4.83/2.27 # and selection function SelectCQArEqLast.
% 4.83/2.27 #
% 4.83/2.27 # Preprocessing time : 0.023 s
% 4.83/2.27 # Presaturation interreduction done
% 4.83/2.27
% 4.83/2.27 # Proof found!
% 4.83/2.27 # SZS status Theorem
% 4.83/2.27 # SZS output start CNFRefutation
% See solution above
% 4.83/2.27 # Training examples: 0 positive, 0 negative
% 4.83/2.27
% 4.83/2.27 # -------------------------------------------------
% 4.83/2.27 # User time : 0.028 s
% 4.83/2.27 # System time : 0.004 s
% 4.83/2.27 # Total time : 0.032 s
% 4.83/2.27 # Maximum resident set size: 7120 pages
% 4.83/2.27
%------------------------------------------------------------------------------