TSTP Solution File: SYN323+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN323+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:13 EDT 2022
% Result : Theorem 7.59s 2.39s
% Output : CNFRefutation 7.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 3 unt; 2 nHn; 9 RR)
% Number of literals : 19 ( 0 equ; 10 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 20 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,negated_conjecture,
( big_g(X1,X2)
| ~ big_f(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oervdqzl/lgb.p',i_0_3) ).
cnf(i_0_1,negated_conjecture,
( ~ big_f(X1,X2)
| ~ big_g(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oervdqzl/lgb.p',i_0_1) ).
cnf(i_0_2,negated_conjecture,
( big_f(X1,X2)
| ~ big_g(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oervdqzl/lgb.p',i_0_2) ).
cnf(i_0_4,negated_conjecture,
( big_f(X1,X2)
| big_g(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oervdqzl/lgb.p',i_0_4) ).
cnf(c_0_9,negated_conjecture,
( big_g(X1,X2)
| ~ big_f(X2,X1) ),
i_0_3 ).
cnf(c_0_10,negated_conjecture,
( ~ big_f(X1,X2)
| ~ big_g(X2,X1) ),
i_0_1 ).
cnf(c_0_11,negated_conjecture,
( big_f(X1,X2)
| ~ big_g(X1,X2) ),
i_0_2 ).
cnf(c_0_12,negated_conjecture,
~ big_f(X1,X2),
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( big_f(X1,X2)
| big_g(X1,X2) ),
i_0_4 ).
cnf(c_0_14,negated_conjecture,
~ big_g(X1,X2),
inference(sr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_13,c_0_12]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN323+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.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 : Mon Jul 11 19:19:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.59/2.39 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.59/2.39 # No SInE strategy applied
% 7.59/2.39 # Trying AutoSched0 for 150 seconds
% 7.59/2.39 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 7.59/2.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.59/2.39 #
% 7.59/2.39 # Preprocessing time : 0.023 s
% 7.59/2.39
% 7.59/2.39 # Proof found!
% 7.59/2.39 # SZS status Theorem
% 7.59/2.39 # SZS output start CNFRefutation
% See solution above
% 7.59/2.39 # Training examples: 0 positive, 0 negative
% 7.59/2.39
% 7.59/2.39 # -------------------------------------------------
% 7.59/2.39 # User time : 0.020 s
% 7.59/2.39 # System time : 0.010 s
% 7.59/2.39 # Total time : 0.030 s
% 7.59/2.39 # Maximum resident set size: 7128 pages
% 7.59/2.39
%------------------------------------------------------------------------------