TSTP Solution File: NUM584+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM584+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:37:37 EDT 2022
% Result : Theorem 9.35s 3.32s
% Output : CNFRefutation 9.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 9 ( 4 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4218,negated_conjecture,
( sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) != xK
| ~ aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d2e785qn/lgb.p',i_0_4218) ).
cnf(i_0_4200,hypothesis,
sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d2e785qn/lgb.p',i_0_4200) ).
cnf(i_0_4208,hypothesis,
aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d2e785qn/lgb.p',i_0_4208) ).
cnf(c_0_4222,negated_conjecture,
( sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) != xK
| ~ aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS) ),
i_0_4218 ).
cnf(c_0_4223,hypothesis,
sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK,
i_0_4200 ).
cnf(c_0_4224,hypothesis,
aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS),
i_0_4208 ).
cnf(c_0_4225,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4222,c_0_4223]),c_0_4224])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM584+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n017.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 : Tue Jul 5 02:49:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 9.35/3.32 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.35/3.32 # No SInE strategy applied
% 9.35/3.32 # Trying AutoSched0 for 150 seconds
% 9.35/3.32 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S2i
% 9.35/3.32 # and selection function SelectGrCQArEqFirst.
% 9.35/3.32 #
% 9.35/3.32 # Preprocessing time : 0.023 s
% 9.35/3.32 # Presaturation interreduction done
% 9.35/3.32
% 9.35/3.32 # Proof found!
% 9.35/3.32 # SZS status Theorem
% 9.35/3.32 # SZS output start CNFRefutation
% See solution above
% 9.35/3.32 # Training examples: 0 positive, 0 negative
% 9.35/3.32
% 9.35/3.32 # -------------------------------------------------
% 9.35/3.32 # User time : 0.025 s
% 9.35/3.32 # System time : 0.006 s
% 9.35/3.32 # Total time : 0.031 s
% 9.35/3.32 # Maximum resident set size: 7124 pages
% 9.35/3.32
%------------------------------------------------------------------------------