TSTP Solution File: SYN047+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN047+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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 : Thu Jul 21 04:49:11 EDT 2022
% Result : Theorem 7.63s 2.27s
% Output : CNFRefutation 7.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 7 unt; 2 nHn; 13 RR)
% Number of literals : 23 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 5 ( 4 usr; 5 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,negated_conjecture,
( q
| s
| ~ p ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-swswb4a9/input.p',i_0_4) ).
cnf(i_0_31,negated_conjecture,
p,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-swswb4a9/input.p',i_0_31) ).
cnf(i_0_5,negated_conjecture,
~ s,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-swswb4a9/input.p',i_0_5) ).
cnf(i_0_1,negated_conjecture,
( s
| ~ p
| ~ r ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-swswb4a9/input.p',i_0_1) ).
cnf(i_0_18,negated_conjecture,
( r
| ~ q ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-swswb4a9/input.p',i_0_18) ).
cnf(c_0_37,negated_conjecture,
( q
| s
| ~ p ),
i_0_4 ).
cnf(c_0_38,negated_conjecture,
p,
i_0_31 ).
cnf(c_0_39,negated_conjecture,
~ s,
i_0_5 ).
cnf(c_0_40,negated_conjecture,
( s
| ~ p
| ~ r ),
i_0_1 ).
cnf(c_0_41,negated_conjecture,
( r
| ~ q ),
i_0_18 ).
cnf(c_0_42,negated_conjecture,
q,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),c_0_39]) ).
cnf(c_0_43,negated_conjecture,
~ r,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_38])]),c_0_39]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN047+1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jul 12 07:30:19 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 7.63/2.27 # ENIGMATIC: Solved by autoschedule:
% 7.63/2.27 # No SInE strategy applied
% 7.63/2.27 # Trying AutoSched0 for 150 seconds
% 7.63/2.27 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 7.63/2.27 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.63/2.27 #
% 7.63/2.27 # Preprocessing time : 0.012 s
% 7.63/2.27
% 7.63/2.27 # Proof found!
% 7.63/2.27 # SZS status Theorem
% 7.63/2.27 # SZS output start CNFRefutation
% See solution above
% 7.63/2.27 # Training examples: 0 positive, 0 negative
% 7.63/2.27
% 7.63/2.27 # -------------------------------------------------
% 7.63/2.27 # User time : 0.012 s
% 7.63/2.27 # System time : 0.003 s
% 7.63/2.27 # Total time : 0.015 s
% 7.63/2.27 # Maximum resident set size: 7120 pages
% 7.63/2.27
%------------------------------------------------------------------------------