TSTP Solution File: NUM633+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM633+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:38:08 EDT 2022
% Result : Theorem 7.80s 2.40s
% Output : CNFRefutation 7.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 14 ( 7 unt; 0 nHn; 14 RR)
% Number of literals : 30 ( 4 equ; 19 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_201,negated_conjecture,
( sdtlpdtrp0(xc,esk26_2(X1,X2)) != X1
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xS) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c24ajhbm/lgb.p',i_0_201) ).
cnf(i_0_203,negated_conjecture,
( sdtlpdtrp0(xc,X1) = szDzizrdt0(xd)
| ~ aElementOf0(X1,slbdtsldtrb0(xO,xK)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c24ajhbm/lgb.p',i_0_203) ).
cnf(i_0_192,hypothesis,
aElementOf0(szDzizrdt0(xd),xT),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c24ajhbm/lgb.p',i_0_192) ).
cnf(i_0_202,negated_conjecture,
( aElementOf0(esk26_2(X1,X2),slbdtsldtrb0(X2,xK))
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xS) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c24ajhbm/lgb.p',i_0_202) ).
cnf(i_0_200,hypothesis,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c24ajhbm/lgb.p',i_0_200) ).
cnf(i_0_195,hypothesis,
isCountable0(xO),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c24ajhbm/lgb.p',i_0_195) ).
cnf(c_0_210,negated_conjecture,
( sdtlpdtrp0(xc,esk26_2(X1,X2)) != X1
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xS) ),
i_0_201 ).
cnf(c_0_211,negated_conjecture,
( sdtlpdtrp0(xc,X1) = szDzizrdt0(xd)
| ~ aElementOf0(X1,slbdtsldtrb0(xO,xK)) ),
i_0_203 ).
cnf(c_0_212,hypothesis,
aElementOf0(szDzizrdt0(xd),xT),
i_0_192 ).
cnf(c_0_213,negated_conjecture,
( ~ aSubsetOf0(X1,xS)
| ~ aElementOf0(esk26_2(szDzizrdt0(xd),X1),slbdtsldtrb0(xO,xK))
| ~ isCountable0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_210,c_0_211])]),c_0_212])]) ).
cnf(c_0_214,negated_conjecture,
( aElementOf0(esk26_2(X1,X2),slbdtsldtrb0(X2,xK))
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xS) ),
i_0_202 ).
cnf(c_0_215,hypothesis,
aSubsetOf0(xO,xS),
i_0_200 ).
cnf(c_0_216,hypothesis,
isCountable0(xO),
i_0_195 ).
cnf(c_0_217,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_213,c_0_214]),c_0_215]),c_0_216]),c_0_212])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM633+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jul 6 07:08:31 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 7.80/2.40 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.80/2.40 # No SInE strategy applied
% 7.80/2.40 # Trying AutoSched0 for 150 seconds
% 7.80/2.40 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.80/2.40 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.80/2.40 #
% 7.80/2.40 # Preprocessing time : 0.023 s
% 7.80/2.40 # Presaturation interreduction done
% 7.80/2.40
% 7.80/2.40 # Proof found!
% 7.80/2.40 # SZS status Theorem
% 7.80/2.40 # SZS output start CNFRefutation
% See solution above
% 7.80/2.40 # Training examples: 0 positive, 0 negative
% 7.80/2.40
% 7.80/2.40 # -------------------------------------------------
% 7.80/2.40 # User time : 0.026 s
% 7.80/2.40 # System time : 0.008 s
% 7.80/2.40 # Total time : 0.033 s
% 7.80/2.40 # Maximum resident set size: 7124 pages
% 7.80/2.40
%------------------------------------------------------------------------------