TSTP Solution File: SYN071+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN071+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:32 EDT 2022
% Result : Theorem 4.35s 2.26s
% Output : CNFRefutation 4.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 7 unt; 4 nHn; 13 RR)
% Number of literals : 19 ( 18 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,negated_conjecture,
b != c,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t8vx_ujc/lgb.p',i_0_3) ).
cnf(i_0_2,plain,
( c = a
| b = d ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t8vx_ujc/lgb.p',i_0_2) ).
cnf(i_0_1,plain,
( b = a
| c = d ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t8vx_ujc/lgb.p',i_0_1) ).
cnf(i_0_4,negated_conjecture,
d != a,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t8vx_ujc/lgb.p',i_0_4) ).
cnf(c_0_9,negated_conjecture,
b != c,
i_0_3 ).
cnf(c_0_10,plain,
( c = a
| b = d ),
i_0_2 ).
cnf(c_0_11,plain,
( b = a
| c = d ),
i_0_1 ).
cnf(c_0_12,negated_conjecture,
d != a,
i_0_4 ).
cnf(c_0_13,negated_conjecture,
( a = c
| c != d ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
a = c,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]) ).
cnf(c_0_15,negated_conjecture,
( c = d
| a != c ),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
c != d,
inference(rw,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_14])]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN071+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n012.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 15:59:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 4.35/2.26 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.35/2.26 # No SInE strategy applied
% 4.35/2.26 # Trying AutoSched0 for 150 seconds
% 4.35/2.26 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_S0a
% 4.35/2.26 # and selection function SelectNegativeLiterals.
% 4.35/2.26 #
% 4.35/2.26 # Preprocessing time : 0.023 s
% 4.35/2.26
% 4.35/2.26 # Proof found!
% 4.35/2.26 # SZS status Theorem
% 4.35/2.26 # SZS output start CNFRefutation
% See solution above
% 4.35/2.26 # Training examples: 0 positive, 0 negative
% 4.35/2.26
% 4.35/2.26 # -------------------------------------------------
% 4.35/2.26 # User time : 0.023 s
% 4.35/2.26 # System time : 0.008 s
% 4.35/2.26 # Total time : 0.031 s
% 4.35/2.26 # Maximum resident set size: 7128 pages
% 4.35/2.26
%------------------------------------------------------------------------------