TSTP Solution File: SYN367+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN367+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:51:44 EDT 2022
% Result : Theorem 7.62s 2.35s
% Output : CNFRefutation 7.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 6 unt; 3 nHn; 5 RR)
% Number of literals : 16 ( 0 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 7 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,negated_conjecture,
( big_q(X1)
| ~ p ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lsyyso8a/input.p',i_0_4) ).
cnf(i_0_5,negated_conjecture,
( p
| big_r(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lsyyso8a/input.p',i_0_5) ).
cnf(i_0_2,negated_conjecture,
~ big_q(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lsyyso8a/input.p',i_0_2) ).
cnf(i_0_1,negated_conjecture,
~ big_r(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lsyyso8a/input.p',i_0_1) ).
cnf(c_0_10,negated_conjecture,
( big_q(X1)
| ~ p ),
i_0_4 ).
cnf(c_0_11,negated_conjecture,
( p
| big_r(X1) ),
i_0_5 ).
cnf(c_0_12,negated_conjecture,
~ big_q(esk1_0),
i_0_2 ).
cnf(c_0_13,negated_conjecture,
( big_r(X1)
| big_q(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
~ big_r(esk2_0),
i_0_1 ).
cnf(c_0_15,negated_conjecture,
big_r(X1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN367+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 14:49:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.62/2.35 # ENIGMATIC: Solved by autoschedule:
% 7.62/2.35 # No SInE strategy applied
% 7.62/2.35 # Trying AutoSched0 for 150 seconds
% 7.62/2.35 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 7.62/2.35 # and selection function SelectNewComplexAHP.
% 7.62/2.35 #
% 7.62/2.35 # Preprocessing time : 0.023 s
% 7.62/2.35 # Presaturation interreduction done
% 7.62/2.35
% 7.62/2.35 # Proof found!
% 7.62/2.35 # SZS status Theorem
% 7.62/2.35 # SZS output start CNFRefutation
% See solution above
% 7.62/2.35 # Training examples: 0 positive, 0 negative
% 7.62/2.35
% 7.62/2.35 # -------------------------------------------------
% 7.62/2.35 # User time : 0.024 s
% 7.62/2.35 # System time : 0.005 s
% 7.62/2.35 # Total time : 0.030 s
% 7.62/2.35 # Maximum resident set size: 7120 pages
% 7.62/2.35
%------------------------------------------------------------------------------