TSTP Solution File: SYN054+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN054+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:17 EDT 2022
% Result : Theorem 8.53s 2.44s
% Output : CNFRefutation 8.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 3 unt; 4 nHn; 13 RR)
% Number of literals : 25 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 10 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,plain,
( big_s(X1)
| ~ big_q(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mj_3pae3/lgb.p',i_0_5) ).
cnf(i_0_1,plain,
( ~ big_s(X1)
| ~ big_q(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mj_3pae3/lgb.p',i_0_1) ).
cnf(i_0_2,plain,
( big_q(X1)
| big_r(X1)
| ~ big_p(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mj_3pae3/lgb.p',i_0_2) ).
cnf(i_0_6,negated_conjecture,
( ~ big_p(X1)
| ~ big_r(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mj_3pae3/lgb.p',i_0_6) ).
cnf(i_0_3,plain,
( big_q(esk2_0)
| big_p(esk1_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mj_3pae3/lgb.p',i_0_3) ).
cnf(c_0_12,plain,
( big_s(X1)
| ~ big_q(X1) ),
i_0_5 ).
cnf(c_0_13,plain,
( ~ big_s(X1)
| ~ big_q(X1) ),
i_0_1 ).
cnf(c_0_14,plain,
( big_q(X1)
| big_r(X1)
| ~ big_p(X1) ),
i_0_2 ).
cnf(c_0_15,plain,
~ big_q(X1),
inference(csr,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( ~ big_p(X1)
| ~ big_r(X1) ),
i_0_6 ).
cnf(c_0_17,plain,
( big_q(esk2_0)
| big_p(esk1_0) ),
i_0_3 ).
cnf(c_0_18,plain,
~ big_p(X1),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_17,c_0_15]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN054+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jul 12 09:08:41 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 8.53/2.44 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.53/2.44 # No SInE strategy applied
% 8.53/2.44 # Trying AutoSched0 for 150 seconds
% 8.53/2.44 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 8.53/2.44 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.53/2.44 #
% 8.53/2.44 # Preprocessing time : 0.013 s
% 8.53/2.44
% 8.53/2.44 # Proof found!
% 8.53/2.44 # SZS status Theorem
% 8.53/2.44 # SZS output start CNFRefutation
% See solution above
% 8.53/2.44 # Training examples: 0 positive, 0 negative
% 8.53/2.44
% 8.53/2.44 # -------------------------------------------------
% 8.53/2.44 # User time : 0.013 s
% 8.53/2.44 # System time : 0.005 s
% 8.53/2.44 # Total time : 0.018 s
% 8.53/2.44 # Maximum resident set size: 7124 pages
% 8.53/2.44
%------------------------------------------------------------------------------