TSTP Solution File: SYN417+1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SYN417+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n005.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 12:00:12 EDT 2022

% Result   : Theorem 0.36s 0.62s
% Output   : Refutation 0.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   30
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   59 (   9 unt;  33 nHn;  59 RR)
%            Number of literals    :  146 ( 145 equ;  51 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-1 aty)
%            Number of variables   :   24 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,negated_conjecture,
    ( X != f(g(X))
    | 'SKOLEMAAAW1'(X) = f(g('SKOLEMAAAW1'(X)))
    | Y != g(f(Y))
    | 'SKOLEMAAAW2'(Y) = g(f('SKOLEMAAAW2'(Y))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cute) ).

cnf(2,negated_conjecture,
    ( X != f(g(X))
    | 'SKOLEMAAAW1'(X) = f(g('SKOLEMAAAW1'(X)))
    | Y != g(f(Y))
    | Y != 'SKOLEMAAAW2'(Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cute) ).

cnf(3,negated_conjecture,
    ( X != f(g(X))
    | X != 'SKOLEMAAAW1'(X)
    | Y != g(f(Y))
    | 'SKOLEMAAAW2'(Y) = g(f('SKOLEMAAAW2'(Y))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cute) ).

cnf(4,negated_conjecture,
    ( X != f(g(X))
    | X != 'SKOLEMAAAW1'(X)
    | Y != g(f(Y))
    | Y != 'SKOLEMAAAW2'(Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cute) ).

cnf(5,negated_conjecture,
    ( 'SKOLEMAAAW3' = f(g('SKOLEMAAAW3'))
    | 'SKOLEMAAAW4' = g(f('SKOLEMAAAW4')) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cute) ).

cnf(6,negated_conjecture,
    ( 'SKOLEMAAAW3' = f(g('SKOLEMAAAW3'))
    | X != g(f(X))
    | 'SKOLEMAAAW4' = X ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cute) ).

cnf(8,negated_conjecture,
    ( X != f(g(X))
    | 'SKOLEMAAAW3' = X
    | Y != g(f(Y))
    | 'SKOLEMAAAW4' = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cute) ).

cnf(9,plain,
    ( 'SKOLEMAAAW3' = f(g('SKOLEMAAAW3'))
    | X != f(g(X))
    | X != 'SKOLEMAAAW1'(X)
    | 'SKOLEMAAAW4' != 'SKOLEMAAAW2'('SKOLEMAAAW4') ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[4,5,theory(equality)]),theory(equality)]) ).

cnf(11,plain,
    ( 'SKOLEMAAAW3' = f(g('SKOLEMAAAW3'))
    | X != f(g(X))
    | 'SKOLEMAAAW1'(X) = f(g('SKOLEMAAAW1'(X)))
    | 'SKOLEMAAAW4' != 'SKOLEMAAAW2'('SKOLEMAAAW4') ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2,5,theory(equality)]),theory(equality)]) ).

cnf(13,plain,
    ( 'SKOLEMAAAW3' = f(g('SKOLEMAAAW3'))
    | X != f(g(X))
    | X != 'SKOLEMAAAW1'(X)
    | 'SKOLEMAAAW2'('SKOLEMAAAW4') = g(f('SKOLEMAAAW2'('SKOLEMAAAW4'))) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,5,theory(equality)]),theory(equality)]) ).

cnf(15,plain,
    ( 'SKOLEMAAAW3' = f(g('SKOLEMAAAW3'))
    | X != f(g(X))
    | 'SKOLEMAAAW1'(X) = f(g('SKOLEMAAAW1'(X)))
    | 'SKOLEMAAAW2'('SKOLEMAAAW4') = g(f('SKOLEMAAAW2'('SKOLEMAAAW4'))) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,5,theory(equality)]),theory(equality)]) ).

cnf(17,plain,
    ( 'SKOLEMAAAW3' = f(g('SKOLEMAAAW3'))
    | f('SKOLEMAAAW4') != 'SKOLEMAAAW1'(f('SKOLEMAAAW4'))
    | 'SKOLEMAAAW4' != 'SKOLEMAAAW2'('SKOLEMAAAW4') ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,5,theory(equality)]),theory(equality)]) ).

cnf(18,plain,
    ( 'SKOLEMAAAW3' = f(g('SKOLEMAAAW3'))
    | 'SKOLEMAAAW1'(f('SKOLEMAAAW4')) = f(g('SKOLEMAAAW1'(f('SKOLEMAAAW4'))))
    | 'SKOLEMAAAW4' != 'SKOLEMAAAW2'('SKOLEMAAAW4') ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,5,theory(equality)]),theory(equality)]) ).

cnf(19,plain,
    ( 'SKOLEMAAAW3' = f(g('SKOLEMAAAW3'))
    | f('SKOLEMAAAW4') != 'SKOLEMAAAW1'(f('SKOLEMAAAW4'))
    | 'SKOLEMAAAW2'('SKOLEMAAAW4') = g(f('SKOLEMAAAW2'('SKOLEMAAAW4'))) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,5,theory(equality)]),theory(equality)]) ).

cnf(20,plain,
    ( 'SKOLEMAAAW3' = f(g('SKOLEMAAAW3'))
    | 'SKOLEMAAAW1'(f('SKOLEMAAAW4')) = f(g('SKOLEMAAAW1'(f('SKOLEMAAAW4'))))
    | 'SKOLEMAAAW2'('SKOLEMAAAW4') = g(f('SKOLEMAAAW2'('SKOLEMAAAW4'))) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,5,theory(equality)]),theory(equality)]) ).

cnf(21,plain,
    ( 'SKOLEMAAAW3' = f(g('SKOLEMAAAW3'))
    | 'SKOLEMAAAW1'(f('SKOLEMAAAW4')) = f(g('SKOLEMAAAW1'(f('SKOLEMAAAW4'))))
    | 'SKOLEMAAAW4' = 'SKOLEMAAAW2'('SKOLEMAAAW4') ),
    inference('HYPERRESOLVE',[status(thm)],[6,20]) ).

cnf(26,plain,
    ( 'SKOLEMAAAW3' = f(g('SKOLEMAAAW3'))
    | 'SKOLEMAAAW1'(f('SKOLEMAAAW4')) = f(g('SKOLEMAAAW1'(f('SKOLEMAAAW4')))) ),
    inference('HYPERRESOLVE',[status(thm)],[18,21]) ).

cnf(27,plain,
    ( 'SKOLEMAAAW3' = f(g('SKOLEMAAAW3'))
    | 'SKOLEMAAAW4' = g('SKOLEMAAAW1'(f('SKOLEMAAAW4'))) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,26,theory(equality)]),theory(equality)]) ).

cnf(42,plain,
    ( 'SKOLEMAAAW3' = f(g('SKOLEMAAAW3'))
    | f('SKOLEMAAAW4') = 'SKOLEMAAAW1'(f('SKOLEMAAAW4')) ),
    inference('PARAMODULATE',[status(thm)],[26,27,theory(equality)]) ).

cnf(43,plain,
    ( 'SKOLEMAAAW3' = f(g('SKOLEMAAAW3'))
    | 'SKOLEMAAAW2'('SKOLEMAAAW4') = g(f('SKOLEMAAAW2'('SKOLEMAAAW4'))) ),
    inference('HYPERRESOLVE',[status(thm)],[19,42]) ).

cnf(45,plain,
    ( 'SKOLEMAAAW3' = f(g('SKOLEMAAAW3'))
    | 'SKOLEMAAAW4' != 'SKOLEMAAAW2'('SKOLEMAAAW4') ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[17,42,theory(equality)]),theory(equality)]) ).

cnf(48,plain,
    ( 'SKOLEMAAAW3' = f(g('SKOLEMAAAW3'))
    | 'SKOLEMAAAW4' = 'SKOLEMAAAW2'('SKOLEMAAAW4') ),
    inference('HYPERRESOLVE',[status(thm)],[6,43]) ).

cnf(54,plain,
    'SKOLEMAAAW3' = f(g('SKOLEMAAAW3')),
    inference('HYPERRESOLVE',[status(thm)],[45,48]) ).

cnf(55,plain,
    ( 'SKOLEMAAAW3' != 'SKOLEMAAAW1'('SKOLEMAAAW3')
    | X != g(f(X))
    | X != 'SKOLEMAAAW2'(X) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[4,54,theory(equality)]),theory(equality)]) ).

cnf(56,plain,
    ( X != f(g(X))
    | 'SKOLEMAAAW3' = X
    | 'SKOLEMAAAW4' = g('SKOLEMAAAW3') ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,54,theory(equality)]),theory(equality)]) ).

cnf(57,plain,
    ( 'SKOLEMAAAW3' != 'SKOLEMAAAW1'('SKOLEMAAAW3')
    | X != g(f(X))
    | 'SKOLEMAAAW2'(X) = g(f('SKOLEMAAAW2'(X))) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,54,theory(equality)]),theory(equality)]) ).

cnf(58,plain,
    ( 'SKOLEMAAAW1'('SKOLEMAAAW3') = f(g('SKOLEMAAAW1'('SKOLEMAAAW3')))
    | X != g(f(X))
    | X != 'SKOLEMAAAW2'(X) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2,54,theory(equality)]),theory(equality)]) ).

cnf(60,plain,
    ( 'SKOLEMAAAW1'('SKOLEMAAAW3') = f(g('SKOLEMAAAW1'('SKOLEMAAAW3')))
    | X != g(f(X))
    | 'SKOLEMAAAW2'(X) = g(f('SKOLEMAAAW2'(X))) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,54,theory(equality)]),theory(equality)]) ).

cnf(64,plain,
    ( 'SKOLEMAAAW3' != 'SKOLEMAAAW1'('SKOLEMAAAW3')
    | g('SKOLEMAAAW3') != 'SKOLEMAAAW2'(g('SKOLEMAAAW3')) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[55,54,theory(equality)]),theory(equality)]) ).

cnf(65,plain,
    ( 'SKOLEMAAAW3' != 'SKOLEMAAAW1'('SKOLEMAAAW3')
    | 'SKOLEMAAAW2'(g('SKOLEMAAAW3')) = g(f('SKOLEMAAAW2'(g('SKOLEMAAAW3')))) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[57,54,theory(equality)]),theory(equality)]) ).

cnf(66,plain,
    ( 'SKOLEMAAAW1'('SKOLEMAAAW3') = f(g('SKOLEMAAAW1'('SKOLEMAAAW3')))
    | g('SKOLEMAAAW3') != 'SKOLEMAAAW2'(g('SKOLEMAAAW3')) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[58,54,theory(equality)]),theory(equality)]) ).

cnf(67,plain,
    ( 'SKOLEMAAAW1'('SKOLEMAAAW3') = f(g('SKOLEMAAAW1'('SKOLEMAAAW3')))
    | 'SKOLEMAAAW2'(g('SKOLEMAAAW3')) = g(f('SKOLEMAAAW2'(g('SKOLEMAAAW3')))) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[60,54,theory(equality)]),theory(equality)]) ).

cnf(70,plain,
    ( 'SKOLEMAAAW1'('SKOLEMAAAW3') = f(g('SKOLEMAAAW1'('SKOLEMAAAW3')))
    | 'SKOLEMAAAW3' = f('SKOLEMAAAW2'(g('SKOLEMAAAW3')))
    | 'SKOLEMAAAW4' = g('SKOLEMAAAW3') ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[56,67,theory(equality)]),theory(equality)]) ).

cnf(71,plain,
    ( 'SKOLEMAAAW1'('SKOLEMAAAW3') = f(g('SKOLEMAAAW1'('SKOLEMAAAW3')))
    | X != f(g(X))
    | 'SKOLEMAAAW3' = X
    | 'SKOLEMAAAW4' = 'SKOLEMAAAW2'(g('SKOLEMAAAW3')) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,67,theory(equality)]),theory(equality)]) ).

cnf(74,plain,
    ( 'SKOLEMAAAW1'('SKOLEMAAAW3') = f(g('SKOLEMAAAW1'('SKOLEMAAAW3')))
    | 'SKOLEMAAAW4' = g('SKOLEMAAAW3')
    | g('SKOLEMAAAW3') = 'SKOLEMAAAW2'(g('SKOLEMAAAW3')) ),
    inference('PARAMODULATE',[status(thm)],[67,70,theory(equality)]) ).

cnf(75,plain,
    ( 'SKOLEMAAAW1'('SKOLEMAAAW3') = f(g('SKOLEMAAAW1'('SKOLEMAAAW3')))
    | 'SKOLEMAAAW4' = g('SKOLEMAAAW3') ),
    inference('HYPERRESOLVE',[status(thm)],[66,74]) ).

cnf(76,plain,
    ( 'SKOLEMAAAW4' = g('SKOLEMAAAW3')
    | 'SKOLEMAAAW3' = 'SKOLEMAAAW1'('SKOLEMAAAW3') ),
    inference('HYPERRESOLVE',[status(thm)],[56,75]) ).

cnf(90,plain,
    ( 'SKOLEMAAAW4' = g('SKOLEMAAAW3')
    | g('SKOLEMAAAW3') != 'SKOLEMAAAW2'(g('SKOLEMAAAW3')) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[64,76,theory(equality)]),theory(equality)]) ).

cnf(91,plain,
    ( 'SKOLEMAAAW4' = g('SKOLEMAAAW3')
    | 'SKOLEMAAAW2'(g('SKOLEMAAAW3')) = g(f('SKOLEMAAAW2'(g('SKOLEMAAAW3')))) ),
    inference('HYPERRESOLVE',[status(thm)],[65,76]) ).

cnf(95,plain,
    ( 'SKOLEMAAAW4' = g('SKOLEMAAAW3')
    | 'SKOLEMAAAW3' = f('SKOLEMAAAW2'(g('SKOLEMAAAW3'))) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[56,91,theory(equality)]),theory(equality)]) ).

cnf(99,plain,
    ( 'SKOLEMAAAW4' = g('SKOLEMAAAW3')
    | g('SKOLEMAAAW3') = 'SKOLEMAAAW2'(g('SKOLEMAAAW3')) ),
    inference('PARAMODULATE',[status(thm)],[91,95,theory(equality)]) ).

cnf(100,plain,
    'SKOLEMAAAW4' = g('SKOLEMAAAW3'),
    inference('HYPERRESOLVE',[status(thm)],[90,99]) ).

cnf(101,plain,
    'SKOLEMAAAW3' = f('SKOLEMAAAW4'),
    inference('REWRITE',[status(thm)],[54,100,theory(equality)]) ).

cnf(106,plain,
    ( 'SKOLEMAAAW3' != 'SKOLEMAAAW1'('SKOLEMAAAW3')
    | 'SKOLEMAAAW4' != 'SKOLEMAAAW2'('SKOLEMAAAW4') ),
    inference('REWRITE',[status(thm)],[64,100,theory(equality)]) ).

cnf(107,plain,
    ( 'SKOLEMAAAW3' != 'SKOLEMAAAW1'('SKOLEMAAAW3')
    | 'SKOLEMAAAW2'('SKOLEMAAAW4') = g(f('SKOLEMAAAW2'('SKOLEMAAAW4'))) ),
    inference('REWRITE',[status(thm)],[65,100,theory(equality)]) ).

cnf(108,plain,
    ( 'SKOLEMAAAW1'('SKOLEMAAAW3') = f(g('SKOLEMAAAW1'('SKOLEMAAAW3')))
    | 'SKOLEMAAAW4' != 'SKOLEMAAAW2'('SKOLEMAAAW4') ),
    inference('REWRITE',[status(thm)],[66,100,theory(equality)]) ).

cnf(109,plain,
    ( 'SKOLEMAAAW1'('SKOLEMAAAW3') = f(g('SKOLEMAAAW1'('SKOLEMAAAW3')))
    | 'SKOLEMAAAW2'('SKOLEMAAAW4') = g(f('SKOLEMAAAW2'('SKOLEMAAAW4'))) ),
    inference('REWRITE',[status(thm)],[67,100,theory(equality)]) ).

cnf(112,plain,
    ( 'SKOLEMAAAW1'('SKOLEMAAAW3') = f(g('SKOLEMAAAW1'('SKOLEMAAAW3')))
    | X != f(g(X))
    | 'SKOLEMAAAW3' = X
    | 'SKOLEMAAAW4' = 'SKOLEMAAAW2'('SKOLEMAAAW4') ),
    inference('REWRITE',[status(thm)],[71,100,theory(equality)]) ).

cnf(118,plain,
    ( 'SKOLEMAAAW1'('SKOLEMAAAW3') = f(g('SKOLEMAAAW1'('SKOLEMAAAW3')))
    | 'SKOLEMAAAW3' = f('SKOLEMAAAW2'('SKOLEMAAAW4'))
    | 'SKOLEMAAAW4' = 'SKOLEMAAAW2'('SKOLEMAAAW4') ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[112,109,theory(equality)]),theory(equality)]) ).

cnf(120,plain,
    ( 'SKOLEMAAAW1'('SKOLEMAAAW3') = f(g('SKOLEMAAAW1'('SKOLEMAAAW3')))
    | 'SKOLEMAAAW4' = 'SKOLEMAAAW2'('SKOLEMAAAW4') ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[109,118,theory(equality)]),100,theory(equality)]) ).

cnf(121,plain,
    'SKOLEMAAAW1'('SKOLEMAAAW3') = f(g('SKOLEMAAAW1'('SKOLEMAAAW3'))),
    inference('HYPERRESOLVE',[status(thm)],[108,120]) ).

cnf(124,plain,
    ( 'SKOLEMAAAW3' = 'SKOLEMAAAW1'('SKOLEMAAAW3')
    | X != g(f(X))
    | 'SKOLEMAAAW4' = X ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,121,theory(equality)]),theory(equality)]) ).

cnf(138,plain,
    ( 'SKOLEMAAAW3' = 'SKOLEMAAAW1'('SKOLEMAAAW3')
    | 'SKOLEMAAAW4' = g('SKOLEMAAAW1'('SKOLEMAAAW3')) ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[124,121,theory(equality)]),theory(equality)]) ).

cnf(139,plain,
    'SKOLEMAAAW3' = 'SKOLEMAAAW1'('SKOLEMAAAW3'),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[121,138,theory(equality)]),101,theory(equality)]) ).

cnf(142,plain,
    'SKOLEMAAAW4' != 'SKOLEMAAAW2'('SKOLEMAAAW4'),
    inference('REWRITE',[status(thm)],[106,139,theory(equality)]) ).

cnf(143,plain,
    'SKOLEMAAAW2'('SKOLEMAAAW4') = g(f('SKOLEMAAAW2'('SKOLEMAAAW4'))),
    inference('REWRITE',[status(thm)],[107,139,theory(equality)]) ).

cnf(144,plain,
    ( X != f(g(X))
    | 'SKOLEMAAAW3' = X ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,143,theory(equality)]),142,theory(equality)]) ).

cnf(146,plain,
    'SKOLEMAAAW3' = f('SKOLEMAAAW2'('SKOLEMAAAW4')),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[144,143,theory(equality)]),theory(equality)]) ).

cnf(147,plain,
    $false,
    inference('REWRITE',[status(thm)],[143,142,100,146,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN417+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.14/0.34  % Computer : n005.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 02:42:22 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.46  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47  * 
% 0.20/0.47  * 
% 0.20/0.48  #<PACKAGE "SNARK-USER">
% 0.20/0.48  * 
% 0.20/0.48  SNARK-TPTP-OPTIONS
% 0.20/0.48  * 
% 0.20/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48   (USE-FACTORING :POS)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48  * 
% 0.20/0.48  "."
% 0.20/0.48  * 
% 0.20/0.48  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-12T02:42:22
% 0.20/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n005.cluster.edu at 2022-07-12T02:42:22
% 0.36/0.62  
% 0.36/0.62  
% 0.36/0.62  #||
% 0.36/0.62  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.36/0.62  % SZS output start Refutation
% See solution above
% 0.36/0.63  ||#
% 0.36/0.63  
% 0.36/0.63  ; Summary of computation:
% 0.36/0.63  ;       533 formulas have been input or derived (from 75 formulas).
% 0.36/0.63  ;       147 (28%) were retained.  Of these,
% 0.36/0.63  ;          137 (93%) were simplified or subsumed later,
% 0.36/0.63  ;           10 ( 7%) are still being kept.
% 0.36/0.63  ; 
% 0.36/0.63  ; Run time in seconds excluding printing time:
% 0.36/0.63  ;     0.001   1%   Read assertion file          (1 call)
% 0.36/0.63  ;     0.000   0%   Assert                       (1 call)
% 0.36/0.63  ;     0.021  15%   Process new row              (508 calls)
% 0.36/0.63  ;     0.011   8%   Resolution                   (148 calls)
% 0.36/0.63  ;     0.010   7%   Paramodulation               (74 calls)
% 0.36/0.63  ;     0.000   0%   Factoring                    (21 calls)
% 0.36/0.63  ;     0.003   2%   Condensing                   (297 calls)
% 0.36/0.63  ;     0.036  26%   Forward subsumption          (297 calls)
% 0.36/0.63  ;     0.005   4%   Backward subsumption         (137 calls)
% 0.36/0.63  ;     0.002   1%   Clause clause subsumption    (259 calls)
% 0.36/0.63  ;     0.012   9%   Forward simplification       (429 calls)
% 0.36/0.63  ;     0.006   4%   Backward simplification      (147 calls)
% 0.36/0.63  ;     0.007   5%   Ordering                     (1,065 calls)
% 0.36/0.63  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.36/0.63  ;     0.000   0%   Purity testing               (1 call)
% 0.36/0.63  ;     0.024  17%   Other
% 0.36/0.63  ;     0.138        Total
% 0.36/0.63  ;     0.147        Real time
% 0.36/0.63  ; 
% 0.36/0.63  ; Term-hash-array has 99 terms in all.
% 0.36/0.63  ; Feature-vector-row-index has 3 entries (42 at peak, 137 added, 134 deleted).
% 0.36/0.63  ; Feature-vector-row-index has 21 nodes (565 at peak, 2,013 added, 1,992 deleted).
% 0.36/0.63  ;  Retrieved 317 possibly forward subsuming rows in 297 calls.
% 0.36/0.63  ;  Retrieved 60 possibly backward subsumed rows in 137 calls.
% 0.36/0.63  ; Path-index has 26 entries (63 at peak, 167 added, 141 deleted).
% 0.36/0.63  ; Path-index has 100 nodes (121 at peak, 210 added, 110 deleted).
% 0.36/0.63  ; Trie-index has 26 entries (63 at peak, 167 added, 141 deleted).
% 0.36/0.63  ; Trie-index has 58 nodes (164 at peak, 433 added, 375 deleted).
% 0.36/0.63  ; Retrieved 83 generalization terms in 834 calls.
% 0.36/0.63  ; Retrieved 9 instance terms in 9 calls.
% 0.36/0.63  ; Retrieved 2,654 unifiable terms in 727 calls.
% 0.36/0.63  ; 
% 0.36/0.63  ; The agenda of rows to give has 2 entries:
% 0.36/0.63  ;     1 with value (4 21)          1 with value (4 29)
% 0.36/0.63  Evaluation took:
% 0.36/0.63    0.148 seconds of real time
% 0.36/0.63    0.131858 seconds of user run time
% 0.36/0.63    0.016297 seconds of system run time
% 0.36/0.63    [Run times include 0.004 seconds GC run time.]
% 0.36/0.63    0 calls to %EVAL
% 0.36/0.63    0 page faults and
% 0.36/0.63    14,692,688 bytes consed.
% 0.36/0.63  :PROOF-FOUND
% 0.36/0.63  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-12T02:42:22
% 0.36/0.63  :PROOF-FOUND
% 0.36/0.63  * 
%------------------------------------------------------------------------------