TSTP Solution File: NUM383+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM383+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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 : Mon Jul 18 08:35:35 EDT 2022
% Result : Theorem 7.23s 2.22s
% Output : CNFRefutation 7.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 8 unt; 2 nHn; 21 RR)
% Number of literals : 40 ( 0 equ; 23 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 27 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_39,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkmu88qr/input.p',i_0_39) ).
cnf(i_0_45,negated_conjecture,
subset(esk13_0,esk12_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkmu88qr/input.p',i_0_45) ).
cnf(i_0_42,plain,
( ~ empty(X1)
| ~ in(X2,X3)
| ~ element(X3,powerset(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkmu88qr/input.p',i_0_42) ).
cnf(i_0_41,plain,
( element(X1,X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkmu88qr/input.p',i_0_41) ).
cnf(i_0_46,negated_conjecture,
in(esk12_0,esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkmu88qr/input.p',i_0_46) ).
cnf(i_0_38,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkmu88qr/input.p',i_0_38) ).
cnf(i_0_1,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qkmu88qr/input.p',i_0_1) ).
cnf(c_0_54,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
i_0_39 ).
cnf(c_0_55,negated_conjecture,
subset(esk13_0,esk12_0),
i_0_45 ).
cnf(c_0_56,plain,
( ~ empty(X1)
| ~ in(X2,X3)
| ~ element(X3,powerset(X1)) ),
i_0_42 ).
cnf(c_0_57,negated_conjecture,
element(esk13_0,powerset(esk12_0)),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,plain,
( element(X1,X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(X2)) ),
i_0_41 ).
cnf(c_0_59,plain,
( ~ in(X1,esk13_0)
| ~ empty(esk12_0) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
in(esk12_0,esk13_0),
i_0_46 ).
cnf(c_0_61,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
i_0_38 ).
cnf(c_0_62,negated_conjecture,
( element(X1,esk12_0)
| ~ in(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_58,c_0_57]) ).
cnf(c_0_63,negated_conjecture,
~ empty(esk12_0),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_64,plain,
( in(X1,esk12_0)
| ~ in(X1,esk13_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]) ).
cnf(c_0_65,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
i_0_1 ).
cnf(c_0_66,negated_conjecture,
in(esk12_0,esk12_0),
inference(spm,[status(thm)],[c_0_64,c_0_60]) ).
cnf(c_0_67,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_66])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM383+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jul 7 00:59:28 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected complete mode:
% 7.23/2.22 # ENIGMATIC: Solved by autoschedule:
% 7.23/2.22 # No SInE strategy applied
% 7.23/2.22 # Trying AutoSched0 for 150 seconds
% 7.23/2.22 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S05FI
% 7.23/2.22 # and selection function SelectMaxLComplexG.
% 7.23/2.22 #
% 7.23/2.22 # Preprocessing time : 0.023 s
% 7.23/2.22 # Presaturation interreduction done
% 7.23/2.22
% 7.23/2.22 # Proof found!
% 7.23/2.22 # SZS status Theorem
% 7.23/2.22 # SZS output start CNFRefutation
% See solution above
% 7.23/2.22 # Training examples: 0 positive, 0 negative
% 7.23/2.22
% 7.23/2.22 # -------------------------------------------------
% 7.23/2.22 # User time : 0.025 s
% 7.23/2.22 # System time : 0.008 s
% 7.23/2.22 # Total time : 0.033 s
% 7.23/2.22 # Maximum resident set size: 7120 pages
% 7.23/2.22
%------------------------------------------------------------------------------