TSTP Solution File: NUM533+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM533+2 : 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:37:04 EDT 2022
% Result : Theorem 8.59s 2.53s
% Output : CNFRefutation 8.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 6 unt; 0 nHn; 10 RR)
% Number of literals : 14 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_23,negated_conjecture,
~ aElementOf0(esk3_0,xC),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x013m2rr/lgb.p',i_0_23) ).
cnf(i_0_26,negated_conjecture,
( aElementOf0(X1,xC)
| ~ aElementOf0(X1,xB) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x013m2rr/lgb.p',i_0_26) ).
cnf(i_0_28,negated_conjecture,
( aElementOf0(X1,xB)
| ~ aElementOf0(X1,xA) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x013m2rr/lgb.p',i_0_28) ).
cnf(i_0_24,negated_conjecture,
aElementOf0(esk3_0,xA),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x013m2rr/lgb.p',i_0_24) ).
cnf(c_0_33,negated_conjecture,
~ aElementOf0(esk3_0,xC),
i_0_23 ).
cnf(c_0_34,negated_conjecture,
( aElementOf0(X1,xC)
| ~ aElementOf0(X1,xB) ),
i_0_26 ).
cnf(c_0_35,negated_conjecture,
~ aElementOf0(esk3_0,xB),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
( aElementOf0(X1,xB)
| ~ aElementOf0(X1,xA) ),
i_0_28 ).
cnf(c_0_37,negated_conjecture,
aElementOf0(esk3_0,xA),
i_0_24 ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM533+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n020.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 : Wed Jul 6 03:25:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.59/2.53 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.59/2.53 # No SInE strategy applied
% 8.59/2.53 # Trying AutoSched0 for 150 seconds
% 8.59/2.53 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 8.59/2.53 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.59/2.53 #
% 8.59/2.53 # Preprocessing time : 0.023 s
% 8.59/2.53 # Presaturation interreduction done
% 8.59/2.53
% 8.59/2.53 # Proof found!
% 8.59/2.53 # SZS status Theorem
% 8.59/2.53 # SZS output start CNFRefutation
% See solution above
% 8.59/2.53 # Training examples: 0 positive, 0 negative
% 8.59/2.53
% 8.59/2.53 # -------------------------------------------------
% 8.59/2.53 # User time : 0.024 s
% 8.59/2.53 # System time : 0.008 s
% 8.59/2.53 # Total time : 0.031 s
% 8.59/2.53 # Maximum resident set size: 7124 pages
% 8.59/2.53
%------------------------------------------------------------------------------