TSTP Solution File: COM011-2 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : COM011-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n020.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 : Fri Jul 15 01:42:41 EDT 2022

% Result   : Unsatisfiable 0.19s 0.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   22 (  11 unt;   5 nHn;  16 RR)
%            Number of literals    :   36 (   0 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;   4 con; 0-3 aty)
%            Number of variables   :   34 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
    c_in(v_F,c_UNITY_Oconstrains(v_A,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_conjecture_2,negated_conjecture,
    ~ c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_Set_ODiffE_1,axiom,
    ( ~ c_in(X,c_minus(Y,Z,tc_set(U)),U)
    | c_in(X,Y,U) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_ODiffE_1) ).

cnf(cls_Set_OsubsetI_0,axiom,
    ( c_in(c_Main_OsubsetI__1(X,Y,Z),X,Z)
    | c_lessequals(X,Y,tc_set(Z)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).

cnf(cls_Set_OsubsetI_1,axiom,
    ( ~ c_in(c_Main_OsubsetI__1(X,Y,Z),Y,Z)
    | c_lessequals(X,Y,tc_set(Z)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetI_1) ).

cnf(cls_UNITY_Oconstrains__weaken__L_0,axiom,
    ( ~ c_in(X,c_UNITY_Oconstrains(Y,Z,U),tc_UNITY_Oprogram(U))
    | ~ c_lessequals(V,Y,tc_set(U))
    | c_in(X,c_UNITY_Oconstrains(V,Z,U),tc_UNITY_Oprogram(U)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_UNITY_Oconstrains__weaken__L_0) ).

cnf(cls_WFair_OensuresI_0,axiom,
    ( ~ c_in(X,c_UNITY_Oconstrains(c_minus(Y,Z,tc_set(U)),c_union(Y,Z,U),U),tc_UNITY_Oprogram(U))
    | ~ c_in(X,c_WFair_Otransient(c_minus(Y,Z,tc_set(U)),U),tc_UNITY_Oprogram(U))
    | c_in(X,c_WFair_Oensures(Y,Z,U),tc_UNITY_Oprogram(U)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_WFair_OensuresI_0) ).

cnf(cls_WFair_OleadsTo__Basis_0,axiom,
    ( ~ c_in(X,c_WFair_Oensures(Y,Z,U),tc_UNITY_Oprogram(U))
    | c_in(X,c_WFair_OleadsTo(Y,Z,U),tc_UNITY_Oprogram(U)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_WFair_OleadsTo__Basis_0) ).

cnf(cls_WFair_Otransient__strengthen_0,axiom,
    ( ~ c_in(X,c_WFair_Otransient(Y,Z),tc_UNITY_Oprogram(Z))
    | ~ c_lessequals(U,Y,tc_set(Z))
    | c_in(X,c_WFair_Otransient(U,Z),tc_UNITY_Oprogram(Z)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_WFair_Otransient__strengthen_0) ).

cnf(12,plain,
    ~ c_in(v_F,c_WFair_Oensures(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)),
    inference('UR-RESOLVE',[status(thm)],[cls_WFair_OleadsTo__Basis_0,cls_conjecture_2]) ).

cnf(13,plain,
    ( c_in(c_Main_OsubsetI__1(X,v_A,t_a),X,t_a)
    | c_in(v_F,c_WFair_Otransient(X,t_a),tc_UNITY_Oprogram(t_a)) ),
    inference('HYPERRESOLVE',[status(thm)],[cls_WFair_Otransient__strengthen_0,cls_conjecture_1,cls_Set_OsubsetI_0]) ).

cnf(14,plain,
    ( c_in(c_Main_OsubsetI__1(X,v_A,t_a),X,t_a)
    | c_in(v_F,c_UNITY_Oconstrains(X,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)) ),
    inference('HYPERRESOLVE',[status(thm)],[cls_UNITY_Oconstrains__weaken__L_0,cls_conjecture_0,cls_Set_OsubsetI_0]) ).

cnf(17,plain,
    ( c_in(v_F,c_WFair_Otransient(c_minus(X,Y,tc_set(t_a)),t_a),tc_UNITY_Oprogram(t_a))
    | c_in(c_Main_OsubsetI__1(c_minus(X,Y,tc_set(t_a)),v_A,t_a),X,t_a) ),
    inference('HYPERRESOLVE',[status(thm)],[cls_Set_ODiffE_1,13]) ).

cnf(22,plain,
    ( c_in(v_F,c_WFair_Otransient(c_minus(v_A,X,tc_set(t_a)),t_a),tc_UNITY_Oprogram(t_a))
    | c_lessequals(c_minus(v_A,X,tc_set(t_a)),v_A,tc_set(t_a)) ),
    inference('HYPERRESOLVE',[status(thm)],[cls_Set_OsubsetI_1,17]) ).

cnf(24,plain,
    c_in(v_F,c_WFair_Otransient(c_minus(v_A,X,tc_set(t_a)),t_a),tc_UNITY_Oprogram(t_a)),
    inference('HYPERRESOLVE',[status(thm)],[cls_WFair_Otransient__strengthen_0,22,cls_conjecture_1]) ).

cnf(25,plain,
    ~ c_in(v_F,c_UNITY_Oconstrains(c_minus(v_A,v_B,tc_set(t_a)),c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)),
    inference('UR-RESOLVE',[status(thm)],[cls_WFair_OensuresI_0,24,12]) ).

cnf(27,plain,
    c_in(c_Main_OsubsetI__1(c_minus(v_A,v_B,tc_set(t_a)),v_A,t_a),c_minus(v_A,v_B,tc_set(t_a)),t_a),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[cls_WFair_OensuresI_0,24,14]),12]) ).

cnf(28,plain,
    ~ c_lessequals(c_minus(v_A,v_B,tc_set(t_a)),v_A,tc_set(t_a)),
    inference('UR-RESOLVE',[status(thm)],[cls_UNITY_Oconstrains__weaken__L_0,25,cls_conjecture_0]) ).

cnf(30,plain,
    ~ c_in(c_Main_OsubsetI__1(c_minus(v_A,v_B,tc_set(t_a)),v_A,t_a),v_A,t_a),
    inference('UR-RESOLVE',[status(thm)],[cls_Set_OsubsetI_1,28]) ).

cnf(31,plain,
    ~ c_in(c_Main_OsubsetI__1(c_minus(v_A,v_B,tc_set(t_a)),v_A,t_a),c_minus(v_A,X,tc_set(t_a)),t_a),
    inference('UR-RESOLVE',[status(thm)],[cls_Set_ODiffE_1,30]) ).

cnf(32,plain,
    $false,
    inference('REWRITE',[status(thm)],[27,31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : COM011-2 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.13  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n020.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 : Thu Jun 16 17:30:49 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p 2022-06-16T17:30:49
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-06-16T17:30:49
% 0.19/0.50  
% 0.19/0.50  
% 0.19/0.50  #||
% 0.19/0.50  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.50  % SZS output start Refutation
% See solution above
% 0.19/0.51  ||#
% 0.19/0.51  
% 0.19/0.51  ; Summary of computation:
% 0.19/0.51  ;        41 formulas have been input or derived (from 24 formulas).
% 0.19/0.51  ;        32 (78%) were retained.  Of these,
% 0.19/0.51  ;            2 ( 6%) were simplified or subsumed later,
% 0.19/0.51  ;           30 (94%) are still being kept.
% 0.19/0.51  ; 
% 0.19/0.51  ; Run time in seconds excluding printing time:
% 0.19/0.51  ;     0.003   8%   Read assertion file          (1 call)
% 0.19/0.51  ;     0.001   3%   Assert                       (10 calls)
% 0.19/0.51  ;     0.001   3%   Process new row              (38 calls)
% 0.19/0.51  ;     0.003   8%   Resolution                   (46 calls)
% 0.19/0.51  ;     0.002   5%   Paramodulation               (23 calls)
% 0.19/0.51  ;     0.000   0%   Factoring                    (5 calls)
% 0.19/0.51  ;     0.000   0%   Condensing                   (14 calls)
% 0.19/0.51  ;     0.001   3%   Forward subsumption          (14 calls)
% 0.19/0.51  ;     0.000   0%   Backward subsumption         (14 calls)
% 0.19/0.51  ;     0.000   0%   Clause clause subsumption    (4 calls)
% 0.19/0.51  ;     0.003   8%   Forward simplification       (36 calls)
% 0.19/0.51  ;     0.001   3%   Backward simplification      (32 calls)
% 0.19/0.51  ;     0.000   0%   Ordering                     (15 calls)
% 0.19/0.51  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.19/0.51  ;     0.000   0%   Purity testing               (1 call)
% 0.19/0.51  ;     0.022  59%   Other
% 0.19/0.51  ;     0.037        Total
% 0.19/0.51  ;     0.040        Real time
% 0.19/0.51  ; 
% 0.19/0.51  ; Term-hash-array has 91 terms in all.
% 0.19/0.51  ; Feature-vector-row-index has 13 entries (13 at peak, 14 added, 1 deleted).
% 0.19/0.51  ; Feature-vector-row-index has 122 nodes (124 at peak, 137 added, 15 deleted).
% 0.19/0.51  ;  Retrieved 4 possibly forward subsuming rows in 14 calls.
% 0.19/0.51  ;  Retrieved 0 possibly backward subsumed rows in 14 calls.
% 0.19/0.51  ; Path-index has 93 entries (94 at peak, 95 added, 2 deleted).
% 0.19/0.51  ; Path-index has 457 nodes (458 at peak, 463 added, 6 deleted).
% 0.19/0.51  ; Trie-index has 93 entries (94 at peak, 95 added, 2 deleted).
% 0.19/0.51  ; Trie-index has 544 nodes (548 at peak, 556 added, 12 deleted).
% 0.19/0.51  ; Retrieved 5 generalization terms in 47 calls.
% 0.19/0.51  ; Retrieved 18 instance terms in 17 calls.
% 0.19/0.51  ; Retrieved 239 unifiable terms in 223 calls.
% 0.19/0.51  ; 
% 0.19/0.51  ; The agenda of rows to give has 7 entries:
% 0.19/0.51  ;     1 with value (4 27)          1 with value (4 32)           1 with value (4 34)
% 0.19/0.51  ;     1 with value (4 29)          1 with value (4 33)           1 with value (4 43)
% 0.19/0.51  ;     1 with value (4 31)
% 0.19/0.51  Evaluation took:
% 0.19/0.51    0.04 seconds of real time
% 0.19/0.51    0.031929 seconds of user run time
% 0.19/0.51    0.008965 seconds of system run time
% 0.19/0.51    0 calls to %EVAL
% 0.19/0.51    0 page faults and
% 0.19/0.51    3,808,296 bytes consed.
% 0.19/0.51  :PROOF-FOUND
% 0.19/0.51  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T17:30:49
% 0.19/0.51  :PROOF-FOUND
% 0.19/0.51  * 
%------------------------------------------------------------------------------