TSTP Solution File: LCL443-10 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : LCL443-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n004.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:22:59 EDT 2022

% Result   : Unsatisfiable 1.16s 1.37s
% Output   : Refutation 1.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   17 (  17 unt;   0 nHn;   5 RR)
%            Number of literals    :   17 (  16 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   6 con; 0-4 aty)
%            Number of variables   :   30 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(ifeq_axiom,axiom,
    ifeq(X,X,Y,Z) = Y,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).

cnf(cls_PropLog_Othms_OMP_0,axiom,
    ifeq(c_in(c_PropLog_Opl_Oop_A_N_62(X,Y,Z),c_PropLog_Othms(U,Z),tc_PropLog_Opl(Z)),true,ifeq(c_in(X,c_PropLog_Othms(U,Z),tc_PropLog_Opl(Z)),true,c_in(Y,c_PropLog_Othms(U,Z),tc_PropLog_Opl(Z)),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms_OMP_0) ).

cnf(cls_PropLog_Odeduction_0,axiom,
    ifeq(c_in(X,c_PropLog_Othms(c_insert(Y,Z,tc_PropLog_Opl(U)),U),tc_PropLog_Opl(U)),true,c_in(c_PropLog_Opl_Oop_A_N_62(Y,X,U),c_PropLog_Othms(Z,U),tc_PropLog_Opl(U)),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Odeduction_0) ).

cnf(cls_PropLog_Othms_OH_0,axiom,
    ifeq(c_in(X,Y,tc_PropLog_Opl(Z)),true,c_in(X,c_PropLog_Othms(Y,Z),tc_PropLog_Opl(Z)),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms_OH_0) ).

cnf(cls_PropLog_Oweaken__left__insert_0,axiom,
    ifeq(c_in(X,c_PropLog_Othms(Y,Z),tc_PropLog_Opl(Z)),true,c_in(X,c_PropLog_Othms(c_insert(U,Y,tc_PropLog_Opl(Z)),Z),tc_PropLog_Opl(Z)),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oweaken__left__insert_0) ).

cnf(cls_Set_OinsertCI_1,axiom,
    c_in(X,c_insert(X,Y,Z),Z) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertCI_1) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_in(c_PropLog_Opl_Oop_A_N_62(v_q,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) != true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(14,plain,
    c_in(X,c_PropLog_Othms(c_insert(X,Y,tc_PropLog_Opl(Z)),Z),tc_PropLog_Opl(Z)) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[cls_PropLog_Othms_OH_0,cls_Set_OinsertCI_1,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(15,plain,
    c_in(v_p,c_PropLog_Othms(c_insert(X,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[cls_PropLog_Oweaken__left__insert_0,cls_conjecture_0,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(16,plain,
    c_in(c_PropLog_Opl_Oop_A_N_62(v_q,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_insert(X,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[cls_PropLog_Oweaken__left__insert_0,cls_conjecture_1,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(47,plain,
    ifeq(c_in(c_PropLog_Opl_Oop_A_N_62(v_p,X,t_a),c_PropLog_Othms(c_insert(Y,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),true,c_in(X,c_PropLog_Othms(c_insert(Y,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),true) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[cls_PropLog_Othms_OMP_0,15,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(62,plain,
    ifeq(c_in(v_q,c_PropLog_Othms(c_insert(X,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),true,c_in(c_PropLog_Opl_Ofalse,c_PropLog_Othms(c_insert(X,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),true) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[cls_PropLog_Othms_OMP_0,16,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(1683,plain,
    c_in(X,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,X,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[47,14,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(1690,plain,
    c_in(c_PropLog_Opl_Ofalse,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[62,1683,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(1704,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[cls_PropLog_Odeduction_0,1690,theory(equality)]),cls_conjecture_2,ifeq_axiom,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL443-10 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jul  2 21:56:38 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  * 
% 0.19/0.46  * 
% 0.19/0.47  #<PACKAGE "SNARK-USER">
% 0.19/0.47  * 
% 0.19/0.47  SNARK-TPTP-OPTIONS
% 0.19/0.47  * 
% 0.19/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47   (USE-FACTORING :POS)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47  * 
% 0.19/0.47  "."
% 0.19/0.47  * 
% 0.19/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-02T21:56:38
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n004.cluster.edu at 2022-07-02T21:56:38
% 1.16/1.37  
% 1.16/1.37  
% 1.16/1.37  #||
% 1.16/1.37  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.16/1.37  % SZS output start Refutation
% See solution above
% 1.16/1.37  ||#
% 1.16/1.37  
% 1.16/1.37  ; Summary of computation:
% 1.16/1.37  ;     11934 formulas have been input or derived (from 481 formulas).
% 1.16/1.37  ;      1704 (14%) were retained.  Of these,
% 1.16/1.37  ;            6 ( 0%) were simplified or subsumed later,
% 1.16/1.37  ;         1698 (100%) are still being kept.
% 1.16/1.37  ; 
% 1.16/1.37  ; Run time in seconds excluding printing time:
% 1.16/1.37  ;     0.002   0%   Read assertion file          (1 call)
% 1.16/1.37  ;     0.001   0%   Assert                       (9 calls)
% 1.16/1.37  ;     0.272  30%   Process new row              (6,203 calls)
% 1.16/1.37  ;     0.018   2%   Resolution                   (960 calls)
% 1.16/1.37  ;     0.283  31%   Paramodulation               (480 calls)
% 1.16/1.37  ;     0.225  25%   Forward simplification       (6,203 calls)
% 1.16/1.37  ;     0.039   4%   Backward simplification      (1,704 calls)
% 1.16/1.37  ;     0.018   2%   Ordering                     (16,031 calls)
% 1.16/1.37  ;     0.000   0%   Sortal reasoning             (32 calls)
% 1.16/1.37  ;     0.000   0%   Purity testing               (1 call)
% 1.16/1.37  ;     0.042   5%   Other
% 1.16/1.37  ;     0.900        Total
% 1.16/1.37  ;     0.902        Real time
% 1.16/1.37  ; 
% 1.16/1.37  ; Term-hash-array has 6,201 terms in all.
% 1.16/1.37  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 1.16/1.37  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 1.16/1.37  ; Path-index has 6,193 entries (6,193 at peak, 6,219 added, 26 deleted).
% 1.16/1.37  ; Path-index has 9,048 nodes (9,048 at peak, 9,091 added, 43 deleted).
% 1.16/1.37  ; Trie-index has 6,193 entries (6,193 at peak, 6,219 added, 26 deleted).
% 1.16/1.37  ; Trie-index has 68,574 nodes (68,574 at peak, 68,886 added, 312 deleted).
% 1.16/1.37  ; Retrieved 23,375 generalization terms in 19,177 calls.
% 1.16/1.37  ; Retrieved 2,200 instance terms in 1,703 calls.
% 1.16/1.37  ; Retrieved 33,344 unifiable terms in 6,142 calls.
% 1.16/1.37  ; 
% 1.16/1.37  ; The agenda of rows to process has 10 entries:
% 1.16/1.37  ;     1 with value 31              1 with value 36               1 with value 40
% 1.16/1.37  ;     2 with value 34              2 with value 37               2 with value 52
% 1.16/1.37  ;     1 with value 35
% 1.16/1.37  ; The agenda of rows to give has 1217 entries:
% 1.16/1.37  ;     1 with value (4 26)        123 with value (4 43)          18 with value (4 57)
% 1.16/1.37  ;     2 with value (4 27)         43 with value (4 44)          20 with value (4 58)
% 1.16/1.37  ;     2 with value (4 28)         77 with value (4 45)          23 with value (4 59)
% 1.16/1.37  ;     2 with value (4 29)         39 with value (4 46)          30 with value (4 60)
% 1.16/1.37  ;     1 with value (4 30)         15 with value (4 47)          18 with value (4 61)
% 1.16/1.37  ;     1 with value (4 31)         11 with value (4 48)          16 with value (4 62)
% 1.16/1.37  ;     1 with value (4 32)         12 with value (4 49)          13 with value (4 63)
% 1.16/1.37  ;     2 with value (4 33)         19 with value (4 50)          25 with value (4 64)
% 1.16/1.37  ;     2 with value (4 35)          9 with value (4 51)          16 with value (4 65)
% 1.16/1.37  ;    96 with value (4 38)         19 with value (4 52)          22 with value (4 66)
% 1.16/1.37  ;   114 with value (4 39)         13 with value (4 53)           8 with value (4 67)
% 1.16/1.37  ;   120 with value (4 40)         18 with value (4 54)           5 with value (4 68)
% 1.16/1.37  ;   139 with value (4 41)         20 with value (4 55)           6 with value (4 69)
% 1.16/1.37  ;    70 with value (4 42)         19 with value (4 56)           7 with value (4 71)
% 1.16/1.37  Evaluation took:
% 1.16/1.37    0.903 seconds of real time
% 1.16/1.37    0.822816 seconds of user run time
% 1.16/1.37    0.08016 seconds of system run time
% 1.16/1.37    [Run times include 0.121 seconds GC run time.]
% 1.16/1.37    0 calls to %EVAL
% 1.16/1.37    0 page faults and
% 1.16/1.37    67,144,504 bytes consed.
% 1.16/1.37  :PROOF-FOUND
% 1.16/1.37  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-02T21:56:39
% 1.16/1.37  :PROOF-FOUND
% 1.16/1.37  * 
%------------------------------------------------------------------------------