TSTP Solution File: LCL130-1 by SNARK---20120808r022

View Problem - Process Solution

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

% Computer : n029.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 : Sun Jul 17 14:20:26 EDT 2022

% Result   : Unsatisfiable 0.20s 0.51s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   14 (  13 unt;   0 nHn;   3 RR)
%            Number of literals    :   16 (   0 equ;   3 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   41 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
    ( ~ is_a_theorem(equivalent(X,Y))
    | ~ is_a_theorem(X)
    | is_a_theorem(Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

cnf(p_4,axiom,
    is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Y,U),equivalent(Z,U)))),X)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p_4) ).

cnf(prove_lg_2,negated_conjecture,
    ~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lg_2) ).

cnf(4,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(X,Z),equivalent(Y,Z))),equivalent(equivalent(U,V),equivalent(equivalent(U,W),equivalent(V,W))))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,p_4,p_4]) ).

cnf(7,plain,
    is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,Z),equivalent(Y,Z)))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,4,p_4]) ).

cnf(9,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(equivalent(X,U),equivalent(Y,U)),Z))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,7,7]) ).

cnf(10,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Y,U),equivalent(Z,U)))),V),equivalent(X,V))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,7,p_4]) ).

cnf(13,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(equivalent(X,U),equivalent(Z,U)))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,9,7]) ).

cnf(20,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(X,Y),Z))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,13,13]) ).

cnf(24,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(U,Z)),equivalent(equivalent(X,Y),U))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,20,9]) ).

cnf(34,plain,
    is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,Y))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,24,4]) ).

cnf(39,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(X,Z))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,34,9]) ).

cnf(41,plain,
    is_a_theorem(equivalent(X,X)),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,39,34]) ).

cnf(52,plain,
    $false,
    inference('UR-RESOLVE',[status(thm)],[condensed_detachment,10,41,prove_lg_2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : LCL130-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.13  % Command  : run-snark %s %d
% 0.14/0.33  % Computer : n029.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % 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 : Mon Jul  4 04:44:26 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.45  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46  * 
% 0.20/0.46  * 
% 0.20/0.46  #<PACKAGE "SNARK-USER">
% 0.20/0.46  * 
% 0.20/0.46  SNARK-TPTP-OPTIONS
% 0.20/0.46  * 
% 0.20/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47   (USE-FACTORING :POS)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47  * 
% 0.20/0.47  "."
% 0.20/0.47  * 
% 0.20/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T04:44:26
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n029.cluster.edu at 2022-07-04T04:44:26
% 0.20/0.51  
% 0.20/0.51  
% 0.20/0.51  #||
% 0.20/0.51  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.51  % SZS output start Refutation
% See solution above
% 0.20/0.52  ||#
% 0.20/0.52  
% 0.20/0.52  ; Summary of computation:
% 0.20/0.52  ;       266 formulas have been input or derived (from 16 formulas).
% 0.20/0.52  ;        52 (20%) were retained.  Of these,
% 0.20/0.52  ;            9 (17%) were simplified or subsumed later,
% 0.20/0.52  ;           43 (83%) are still being kept.
% 0.20/0.52  ; 
% 0.20/0.52  ; Run time in seconds excluding printing time:
% 0.20/0.52  ;     0.002   4%   Read assertion file          (1 call)
% 0.20/0.52  ;     0.000   0%   Assert                       (3 calls)
% 0.20/0.52  ;     0.009  19%   Process new row              (180 calls)
% 0.20/0.52  ;     0.010  21%   Resolution                   (30 calls)
% 0.20/0.52  ;     0.001   2%   Paramodulation               (15 calls)
% 0.20/0.52  ;     0.000   0%   Condensing                   (1 call)
% 0.20/0.52  ;     0.000   0%   Forward subsumption          (1 call)
% 0.20/0.52  ;     0.000   0%   Backward subsumption         (1 call)
% 0.20/0.52  ;     0.002   4%   Forward simplification       (174 calls)
% 0.20/0.52  ;     0.003   6%   Backward simplification      (52 calls)
% 0.20/0.52  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.20/0.52  ;     0.000   0%   Purity testing               (1 call)
% 0.20/0.52  ;     0.020  43%   Other
% 0.20/0.52  ;     0.047        Total
% 0.20/0.52  ;     0.050        Real time
% 0.20/0.52  ; 
% 0.20/0.52  ; Term-hash-array has 213 terms in all.
% 0.20/0.52  ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 0.20/0.52  ; Feature-vector-row-index has 4 nodes (4 at peak, 4 added, 0 deleted).
% 0.20/0.52  ;  Retrieved 0 possibly forward subsuming rows in 1 call.
% 0.20/0.52  ;  Retrieved 0 possibly backward subsumed rows in 1 call.
% 0.20/0.52  ; Path-index has 195 entries (195 at peak, 222 added, 27 deleted).
% 0.20/0.52  ; Path-index has 535 nodes (535 at peak, 539 added, 4 deleted).
% 0.20/0.52  ; Trie-index has 195 entries (195 at peak, 222 added, 27 deleted).
% 0.20/0.52  ; Trie-index has 1,254 nodes (1,254 at peak, 1,443 added, 189 deleted).
% 0.20/0.52  ; Retrieved 187 generalization terms in 173 calls.
% 0.20/0.52  ; Retrieved 183 instance terms in 50 calls.
% 0.20/0.52  ; Retrieved 1,930 unifiable terms in 339 calls.
% 0.20/0.52  ; 
% 0.20/0.52  ; The agenda of rows to process has 36 entries:
% 0.20/0.52  ;     1 with value 10              6 with value 34               5 with value 38
% 0.20/0.52  ;     4 with value 30              4 with value 36               1 with value 42
% 0.20/0.52  ;     4 with value 31              4 with value 37               1 with value 48
% 0.20/0.52  ;     6 with value 32
% 0.20/0.52  ; The agenda of rows to give has 30 entries:
% 0.20/0.52  ;     6 with value (4 30)          3 with value (4 37)           4 with value (4 44)
% 0.20/0.52  ;     2 with value (4 31)          2 with value (4 38)           1 with value (4 48)
% 0.20/0.52  ;     4 with value (4 35)          2 with value (4 40)           1 with value (4 49)
% 0.20/0.52  ;     4 with value (4 36)          1 with value (4 43)
% 0.20/0.52  Evaluation took:
% 0.20/0.52    0.05 seconds of real time
% 0.20/0.52    0.045223 seconds of user run time
% 0.20/0.52    0.005251 seconds of system run time
% 0.20/0.52    0 calls to %EVAL
% 0.20/0.52    0 page faults and
% 0.20/0.52    3,885,528 bytes consed.
% 0.20/0.52  :PROOF-FOUND
% 0.20/0.52  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T04:44:26
% 0.20/0.52  :PROOF-FOUND
% 0.20/0.52  * 
%------------------------------------------------------------------------------