TSTP Solution File: SEU169+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU169+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:39:09 EDT 2022
% Result : Theorem 7.52s 2.33s
% Output : CNFRefutation 7.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 11 unt; 2 nHn; 19 RR)
% Number of literals : 33 ( 2 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 21 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_18,plain,
( subset(X1,X2)
| X3 != powerset(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7fl59h2m/lgb.p',i_0_18) ).
cnf(i_0_22,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7fl59h2m/lgb.p',i_0_22) ).
cnf(i_0_100,negated_conjecture,
element(esk19_0,powerset(esk18_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7fl59h2m/lgb.p',i_0_100) ).
cnf(i_0_82,plain,
~ empty(powerset(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7fl59h2m/lgb.p',i_0_82) ).
cnf(i_0_45,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7fl59h2m/lgb.p',i_0_45) ).
cnf(i_0_99,negated_conjecture,
in(esk20_0,esk19_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7fl59h2m/lgb.p',i_0_99) ).
cnf(i_0_98,negated_conjecture,
~ in(esk20_0,esk18_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7fl59h2m/lgb.p',i_0_98) ).
cnf(c_0_108,plain,
( subset(X1,X2)
| X3 != powerset(X2)
| ~ in(X1,X3) ),
i_0_18 ).
cnf(c_0_109,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
i_0_22 ).
cnf(c_0_110,negated_conjecture,
element(esk19_0,powerset(esk18_0)),
i_0_100 ).
cnf(c_0_111,plain,
~ empty(powerset(X1)),
i_0_82 ).
cnf(c_0_112,plain,
( subset(X1,X2)
| ~ in(X1,powerset(X2)) ),
inference(er,[status(thm)],[c_0_108]) ).
cnf(c_0_113,negated_conjecture,
in(esk19_0,powerset(esk18_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111]) ).
cnf(c_0_114,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_45 ).
cnf(c_0_115,plain,
subset(esk19_0,esk18_0),
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_116,plain,
( in(X1,esk18_0)
| ~ in(X1,esk19_0) ),
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_117,negated_conjecture,
in(esk20_0,esk19_0),
i_0_99 ).
cnf(c_0_118,negated_conjecture,
~ in(esk20_0,esk18_0),
i_0_98 ).
cnf(c_0_119,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_118]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU169+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 04:06:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 7.52/2.33 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.52/2.33 # No SInE strategy applied
% 7.52/2.33 # Trying AutoSched0 for 150 seconds
% 7.52/2.33 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S02CN
% 7.52/2.33 # and selection function SelectAntiRROptimalLit.
% 7.52/2.33 #
% 7.52/2.33 # Preprocessing time : 0.025 s
% 7.52/2.33 # Presaturation interreduction done
% 7.52/2.33
% 7.52/2.33 # Proof found!
% 7.52/2.33 # SZS status Theorem
% 7.52/2.33 # SZS output start CNFRefutation
% See solution above
% 7.52/2.33 # Training examples: 0 positive, 0 negative
% 7.52/2.33
% 7.52/2.33 # -------------------------------------------------
% 7.52/2.33 # User time : 0.030 s
% 7.52/2.33 # System time : 0.005 s
% 7.52/2.33 # Total time : 0.035 s
% 7.52/2.33 # Maximum resident set size: 7120 pages
% 7.52/2.33
%------------------------------------------------------------------------------