↑ Up

SNARK---20120808r022.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SYN037-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n015.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 11:56:50 EDT 2022

% Result   : Unsatisfiable 0.19s 0.53s
% Output   : Refutation 0.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   64
%            Number of leaves      :   35
% Syntax   : Number of clauses     :  131 (  15 unt;  84 nHn;  94 RR)
%            Number of literals    :  318 (   0 equ;  63 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   13 (  12 usr;   9 prp; 0-1 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-1 aty)
%            Number of variables   :   51 (  40 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_1,negated_conjecture,
    ( ~ n2
    | ~ n9
    | ~ n6
    | ~ n10 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).

cnf(clause_2,negated_conjecture,
    ( ~ n2
    | ~ n9
    | n6
    | n10 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).

cnf(clause_3,negated_conjecture,
    ( n2
    | n9
    | ~ n6
    | ~ n10 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).

cnf(clause_4,negated_conjecture,
    ( n2
    | n9
    | n6
    | n10 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).

cnf(clause_5,negated_conjecture,
    ( ~ n2
    | n9
    | ~ n6
    | n10 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).

cnf(clause_6,negated_conjecture,
    ( ~ n2
    | n9
    | n6
    | ~ n10 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).

cnf(clause_7,negated_conjecture,
    ( n2
    | ~ n9
    | ~ n6
    | n10 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).

cnf(clause_9,negated_conjecture,
    ( ~ q(s8)
    | n8 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).

cnf(clause_10,negated_conjecture,
    ( ~ n8
    | q(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_10) ).

cnf(clause_11,negated_conjecture,
    ( ~ p(X)
    | n7 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).

cnf(clause_12,negated_conjecture,
    ( ~ n7
    | p(s7) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_12) ).

cnf(clause_13,negated_conjecture,
    ( ~ n5(X)
    | n6 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_13) ).

cnf(clause_14,negated_conjecture,
    ( ~ n6
    | n5(s6) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_14) ).

cnf(clause_15,negated_conjecture,
    ( ~ q(s5(X))
    | ~ q(X)
    | n5(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_15) ).

cnf(clause_16,negated_conjecture,
    ( q(s5(X))
    | q(X)
    | n5(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_16) ).

cnf(clause_17,negated_conjecture,
    ( ~ n5(X)
    | ~ q(Y)
    | q(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_17) ).

cnf(clause_18,negated_conjecture,
    ( ~ n5(X)
    | q(Y)
    | ~ q(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_18) ).

cnf(clause_19,negated_conjecture,
    ( ~ p(s4)
    | n4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_19) ).

cnf(clause_20,negated_conjecture,
    ( ~ n4
    | p(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_20) ).

cnf(clause_21,negated_conjecture,
    ( ~ q(X)
    | n3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_21) ).

cnf(clause_22,negated_conjecture,
    ( ~ n3
    | q(s3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_22) ).

cnf(clause_23,negated_conjecture,
    ( ~ n1(X)
    | n2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_23) ).

cnf(clause_24,negated_conjecture,
    ( ~ n2
    | n1(s2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_24) ).

cnf(clause_25,negated_conjecture,
    ( ~ p(X)
    | ~ p(s1(X))
    | n1(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_25) ).

cnf(clause_26,negated_conjecture,
    ( p(X)
    | p(s1(X))
    | n1(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_26) ).

cnf(clause_27,negated_conjecture,
    ( ~ n1(X)
    | ~ p(X)
    | p(Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_27) ).

cnf(clause_28,negated_conjecture,
    ( ~ n1(X)
    | p(X)
    | ~ p(Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_28) ).

cnf(clause_29,negated_conjecture,
    ( ~ n3
    | ~ n4
    | n9 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_29) ).

cnf(clause_30,negated_conjecture,
    ( n3
    | n4
    | n9 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_30) ).

cnf(clause_31,negated_conjecture,
    ( ~ n3
    | n4
    | ~ n9 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_31) ).

cnf(clause_32,negated_conjecture,
    ( n3
    | ~ n4
    | ~ n9 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_32) ).

cnf(clause_33,negated_conjecture,
    ( ~ n7
    | ~ n8
    | n10 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_33) ).

cnf(clause_34,negated_conjecture,
    ( n7
    | n8
    | n10 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_34) ).

cnf(clause_35,negated_conjecture,
    ( ~ n7
    | n8
    | ~ n10 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_35) ).

cnf(clause_36,negated_conjecture,
    ( n7
    | ~ n8
    | ~ n10 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_36) ).

cnf(37,plain,
    ( n7
    | n10
    | q(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_10,clause_34]) ).

cnf(38,plain,
    ( q(X)
    | n5(X)
    | n3 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_21,clause_16]) ).

cnf(39,plain,
    ( p(X)
    | n1(X)
    | n7 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_11,clause_26]) ).

cnf(40,plain,
    ( n7
    | n10
    | n3 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_21,37]) ).

cnf(41,plain,
    ( n7
    | n10
    | n5(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_15,37,37]) ).

cnf(42,plain,
    ( n10
    | n3
    | p(s7) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_12,40]) ).

cnf(43,plain,
    ( n7
    | n10
    | n6 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_13,41]) ).

cnf(44,plain,
    ( n10
    | n6
    | p(s7) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_12,43]) ).

cnf(45,plain,
    ( n5(X)
    | n3 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_21,38]) ).

cnf(46,plain,
    ( n3
    | n6 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_13,45]) ).

cnf(47,plain,
    ( n3
    | n4
    | n2
    | n10 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_7,46,clause_30]) ).

cnf(48,plain,
    ( n1(X)
    | n7 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_11,39]) ).

cnf(49,plain,
    ( n7
    | n2 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_23,48]) ).

cnf(51,plain,
    ( n3
    | n2
    | n10
    | p(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_20,47]) ).

cnf(52,plain,
    ( n3
    | n2
    | n10
    | n1(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_25,51,51]) ).

cnf(53,plain,
    ( n3
    | n2
    | n10 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_23,52]) ).

cnf(54,plain,
    ( n2
    | n10
    | n6
    | n4 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_31,53,clause_4]) ).

cnf(55,plain,
    ( n2
    | n10
    | q(s3) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_22,53]) ).

cnf(56,plain,
    ( n2
    | n10
    | n4
    | n5(s6) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_14,54]) ).

cnf(57,plain,
    ( n2
    | n10
    | n4
    | q(s6) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_17,56,55]) ).

cnf(58,plain,
    ( n2
    | n10
    | n4
    | q(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_18,57,56]) ).

cnf(59,plain,
    ( n2
    | n10
    | n4
    | n8 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_9,58]) ).

cnf(61,plain,
    ( n2
    | n10
    | n4 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_33,59,49]) ).

cnf(63,plain,
    ( n2
    | n10
    | p(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_20,61]) ).

cnf(64,plain,
    ( n2
    | n10
    | n1(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_25,63,63]) ).

cnf(65,plain,
    ( n2
    | n10 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_23,64]) ).

cnf(66,plain,
    ( n10
    | n3
    | n9 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_5,65,46]) ).

cnf(67,plain,
    ( n10
    | n1(s2) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_24,65]) ).

cnf(68,plain,
    ( n10
    | n6
    | p(s2) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_28,67,44]) ).

cnf(69,plain,
    ( n10
    | n3
    | p(s2) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_28,67,42]) ).

cnf(71,plain,
    ( n10
    | n6
    | p(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_27,68,67]) ).

cnf(72,plain,
    ( n10
    | n3
    | p(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_27,69,67]) ).

cnf(73,plain,
    ( n10
    | n6
    | n4 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_19,71]) ).

cnf(75,plain,
    ( n10
    | n4
    | n9 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_5,73,65]) ).

cnf(77,plain,
    ( n10
    | n3
    | n4 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_19,72]) ).

cnf(79,plain,
    ( n10
    | n3 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_32,77,66]) ).

cnf(80,plain,
    ( n10
    | q(s3) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_22,79]) ).

cnf(81,plain,
    ( n10
    | n4 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_31,75,79]) ).

cnf(82,plain,
    ( n10
    | n9 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_29,81,79]) ).

cnf(83,plain,
    ( n10
    | p(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_20,81]) ).

cnf(84,plain,
    ( n10
    | n6 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_2,82,65]) ).

cnf(85,plain,
    ( n10
    | n5(s6) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_14,84]) ).

cnf(86,plain,
    ( n10
    | n7 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_11,83]) ).

cnf(88,plain,
    ( n10
    | q(s6) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_17,85,80]) ).

cnf(89,plain,
    ( n10
    | q(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_18,88,85]) ).

cnf(90,plain,
    ( n10
    | n8 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_9,89]) ).

cnf(92,plain,
    n10,
    inference('HYPERRESOLVE',[status(thm)],[clause_33,90,86]) ).

cnf(93,plain,
    ( ~ n2
    | ~ n9
    | ~ n6 ),
    inference('REWRITE',[status(thm)],[clause_1,92]) ).

cnf(94,plain,
    ( n2
    | n9
    | ~ n6 ),
    inference('REWRITE',[status(thm)],[clause_3,92]) ).

cnf(95,plain,
    ( ~ n2
    | n9
    | n6 ),
    inference('REWRITE',[status(thm)],[clause_6,92]) ).

cnf(97,plain,
    ( ~ n7
    | n8 ),
    inference('REWRITE',[status(thm)],[clause_35,92]) ).

cnf(98,plain,
    ( n7
    | ~ n8 ),
    inference('REWRITE',[status(thm)],[clause_36,92]) ).

cnf(99,plain,
    ( n2
    | n8 ),
    inference('HYPERRESOLVE',[status(thm)],[97,49]) ).

cnf(101,plain,
    ( n2
    | q(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_10,99]) ).

cnf(102,plain,
    ( n2
    | n3 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_21,101]) ).

cnf(103,plain,
    ( n2
    | n5(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_15,101,101]) ).

cnf(104,plain,
    ( n2
    | n6 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_13,103]) ).

cnf(105,plain,
    ( n2
    | n9 ),
    inference('HYPERRESOLVE',[status(thm)],[94,104]) ).

cnf(106,plain,
    ( n2
    | n4 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_31,105,102]) ).

cnf(107,plain,
    ( n2
    | p(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_20,106]) ).

cnf(108,plain,
    ( n2
    | n1(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_25,107,107]) ).

cnf(109,plain,
    n2,
    inference('HYPERRESOLVE',[status(thm)],[clause_23,108]) ).

cnf(110,plain,
    n1(s2),
    inference('REWRITE',[status(thm)],[clause_24,109]) ).

cnf(111,plain,
    ( ~ n9
    | ~ n6 ),
    inference('REWRITE',[status(thm)],[93,109]) ).

cnf(112,plain,
    ( n9
    | n6 ),
    inference('REWRITE',[status(thm)],[95,109]) ).

cnf(113,plain,
    ( n3
    | n4 ),
    inference('HYPERRESOLVE',[status(thm)],[111,clause_30,46]) ).

cnf(114,plain,
    ( p(X)
    | n1(X)
    | p(s2) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_28,110,clause_26]) ).

cnf(115,plain,
    ( n3
    | p(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_20,113]) ).

cnf(116,plain,
    ( n3
    | n7 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_11,115]) ).

cnf(118,plain,
    ( n3
    | n8 ),
    inference('HYPERRESOLVE',[status(thm)],[97,116]) ).

cnf(119,plain,
    ( n3
    | q(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_10,118]) ).

cnf(120,plain,
    ( n1(X)
    | p(s2) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_28,114,110]) ).

cnf(121,plain,
    ( n1(X)
    | p(Y) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_27,120,110]) ).

cnf(123,plain,
    n1(X),
    inference('CONDENSE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[clause_25,121,121])]) ).

cnf(124,plain,
    ( ~ p(X)
    | p(Y) ),
    inference('REWRITE',[status(thm)],[clause_27,123]) ).

cnf(125,plain,
    n3,
    inference('HYPERRESOLVE',[status(thm)],[clause_21,119]) ).

cnf(126,plain,
    q(s3),
    inference('REWRITE',[status(thm)],[clause_22,125]) ).

cnf(127,plain,
    ( ~ n4
    | n9 ),
    inference('REWRITE',[status(thm)],[clause_29,125]) ).

cnf(128,plain,
    ( n4
    | ~ n9 ),
    inference('REWRITE',[status(thm)],[clause_31,125]) ).

cnf(129,plain,
    ( n6
    | n4 ),
    inference('HYPERRESOLVE',[status(thm)],[128,112]) ).

cnf(130,plain,
    ( n4
    | n5(s6) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_14,129]) ).

cnf(131,plain,
    ( n4
    | q(s6) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_17,130,126]) ).

cnf(132,plain,
    ( n4
    | q(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_18,131,130]) ).

cnf(133,plain,
    ( n4
    | n8 ),
    inference('HYPERRESOLVE',[status(thm)],[clause_9,132]) ).

cnf(135,plain,
    ( n4
    | n7 ),
    inference('HYPERRESOLVE',[status(thm)],[98,133]) ).

cnf(136,plain,
    ( n4
    | p(s7) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_12,135]) ).

cnf(137,plain,
    ( n4
    | p(X) ),
    inference('HYPERRESOLVE',[status(thm)],[124,136]) ).

cnf(138,plain,
    n4,
    inference('HYPERRESOLVE',[status(thm)],[clause_19,137]) ).

cnf(139,plain,
    p(X),
    inference('REWRITE',[status(thm)],[clause_20,138]) ).

cnf(140,plain,
    n7,
    inference('REWRITE',[status(thm)],[clause_11,139]) ).

cnf(141,plain,
    n8,
    inference('REWRITE',[status(thm)],[97,140]) ).

cnf(142,plain,
    q(X),
    inference('REWRITE',[status(thm)],[clause_10,141]) ).

cnf(143,plain,
    n5(X),
    inference('REWRITE',[status(thm)],[clause_15,142]) ).

cnf(144,plain,
    n6,
    inference('REWRITE',[status(thm)],[clause_13,143]) ).

cnf(145,plain,
    ~ n9,
    inference('REWRITE',[status(thm)],[111,144]) ).

cnf(146,plain,
    $false,
    inference('REWRITE',[status(thm)],[127,145,138]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN037-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n015.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 23:23:39 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45  * 
% 0.19/0.45  * 
% 0.19/0.46  #<PACKAGE "SNARK-USER">
% 0.19/0.46  * 
% 0.19/0.46  SNARK-TPTP-OPTIONS
% 0.19/0.46  * 
% 0.19/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46   (USE-FACTORING :POS)
% 0.19/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46  * 
% 0.19/0.46  "."
% 0.19/0.46  * 
% 0.19/0.46  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-11T23:23:40
% 0.19/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n015.cluster.edu at 2022-07-11T23:23:40
% 0.19/0.53  
% 0.19/0.53  
% 0.19/0.53  #||
% 0.19/0.53  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.53  % SZS output start Refutation
% See solution above
% 0.37/0.54  ||#
% 0.37/0.54  
% 0.37/0.54  ; Summary of computation:
% 0.37/0.54  ;       479 formulas have been input or derived (from 129 formulas).
% 0.37/0.54  ;       146 (30%) were retained.  Of these,
% 0.37/0.54  ;          133 (91%) were simplified or subsumed later,
% 0.37/0.54  ;           13 ( 9%) are still being kept.
% 0.37/0.54  ; 
% 0.37/0.54  ; Run time in seconds excluding printing time:
% 0.37/0.54  ;     0.005   7%   Read assertion file          (1 call)
% 0.37/0.54  ;     0.001   1%   Assert                       (36 calls)
% 0.37/0.54  ;     0.010  14%   Process new row              (468 calls)
% 0.37/0.54  ;     0.006   8%   Resolution                   (256 calls)
% 0.37/0.54  ;     0.002   3%   Paramodulation               (128 calls)
% 0.37/0.54  ;     0.001   1%   Factoring                    (83 calls)
% 0.37/0.54  ;     0.000   0%   Condensing                   (350 calls)
% 0.37/0.54  ;     0.003   4%   Forward subsumption          (349 calls)
% 0.37/0.54  ;     0.003   4%   Backward subsumption         (131 calls)
% 0.37/0.54  ;     0.001   1%   Clause clause subsumption    (281 calls)
% 0.37/0.54  ;     0.007  10%   Forward simplification       (368 calls)
% 0.37/0.54  ;     0.002   3%   Backward simplification      (146 calls)
% 0.37/0.54  ;     0.001   1%   Ordering                     (267 calls)
% 0.37/0.54  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.37/0.54  ;     0.001   1%   Purity testing               (1 call)
% 0.37/0.54  ;     0.028  39%   Other
% 0.37/0.54  ;     0.071        Total
% 0.37/0.54  ;     0.082        Real time
% 0.37/0.54  ; 
% 0.37/0.54  ; Term-hash-array has 18 terms in all.
% 0.37/0.54  ; Feature-vector-row-index has 0 entries (55 at peak, 131 added, 131 deleted).
% 0.37/0.54  ; Feature-vector-row-index has 1 node (144 at peak, 274 added, 273 deleted).
% 0.37/0.54  ;  Retrieved 412 possibly forward subsuming rows in 349 calls.
% 0.37/0.54  ;  Retrieved 68 possibly backward subsumed rows in 131 calls.
% 0.37/0.54  ; Path-index has 12 entries (31 at peak, 42 added, 30 deleted).
% 0.37/0.54  ; Path-index has 21 nodes (38 at peak, 48 added, 27 deleted).
% 0.37/0.54  ; Trie-index has 12 entries (31 at peak, 42 added, 30 deleted).
% 0.37/0.54  ; Trie-index has 17 nodes (38 at peak, 48 added, 31 deleted).
% 0.37/0.54  ; Retrieved 6 generalization terms in 41 calls.
% 0.37/0.54  ; Retrieved 20 instance terms in 14 calls.
% 0.37/0.54  ; Retrieved 1,111 unifiable terms in 670 calls.
% 0.37/0.54  ; 
% 0.37/0.54  ; The agenda of rows to process has 2 entries:
% 0.37/0.54  ;     1 with value 11              1 with value 13
% 0.37/0.54  ; The agenda of input rows to give has 7 entries:
% 0.37/0.54  ;     4 with value 1               3 with value 3
% 0.37/0.54  ; The agenda of rows to give has 3 entries:
% 0.37/0.54  ;     1 with value (4 10)          1 with value (4 13)           1 with value (4 30)
% 0.37/0.54  Evaluation took:
% 0.37/0.54    0.083 seconds of real time
% 0.37/0.54    0.069653 seconds of user run time
% 0.37/0.54    0.013025 seconds of system run time
% 0.37/0.54    0 calls to %EVAL
% 0.37/0.54    0 page faults and
% 0.37/0.54    9,749,888 bytes consed.
% 0.37/0.54  :PROOF-FOUND
% 0.37/0.54  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-11T23:23:40
% 0.37/0.54  :PROOF-FOUND
% 0.37/0.54  * 
%------------------------------------------------------------------------------