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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : CSR008+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n017.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 23:17:58 EDT 2022

% Result   : Theorem 0.57s 0.76s
% Output   : Refutation 0.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   25
% Syntax   : Number of clauses     :   61 (  35 unt;  10 nHn;  55 RR)
%            Number of literals    :  100 (  23 equ;  39 neg)
%            Maximal clause size   :    6 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-4 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-3 aty)
%            Number of variables   :   50 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ stoppedIn(X,Y,Z)
    | happens('SKOLEMAAAV1'(X,Z,Y),'SKOLEMAAAV2'(X,Z,Y)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',stoppedin_defn) ).

cnf(2,axiom,
    ( ~ stoppedIn(X,Y,Z)
    | less(X,'SKOLEMAAAV2'(X,Z,Y)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',stoppedin_defn) ).

cnf(3,axiom,
    ( ~ stoppedIn(X,Y,Z)
    | less('SKOLEMAAAV2'(X,Z,Y),Z) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',stoppedin_defn) ).

cnf(11,axiom,
    ( ~ happens(X,Y)
    | ~ initiates(X,Z,Y)
    | ~ less(n0,U)
    | ~ trajectory(Z,Y,V,U)
    | stoppedIn(Y,Z,plus(Y,U))
    | holdsAt(V,plus(Y,U)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',change_holding) ).

cnf(43,axiom,
    ( initiates(X,Y,Z)
    | X != tapOn
    | Y != filling ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',initiates_all_defn) ).

cnf(58,axiom,
    ( ~ happens(X,Y)
    | Y = n0
    | holdsAt(waterLevel(n3),Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',happens_all_defn) ).

cnf(61,axiom,
    ( happens(X,Y)
    | X != tapOn
    | Y != n0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',happens_all_defn) ).

cnf(63,axiom,
    ( ~ holdsAt(waterLevel(X),Y)
    | Z != plus(X,U)
    | trajectory(filling,Y,waterLevel(Z),U) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',change_of_waterLevel) ).

cnf(64,axiom,
    ( ~ holdsAt(waterLevel(X),Y)
    | ~ holdsAt(waterLevel(Z),Y)
    | X = Z ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',same_waterLevel) ).

cnf(74,axiom,
    plus(n0,n1) = n1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_1) ).

cnf(75,axiom,
    plus(n0,n2) = n2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_2) ).

cnf(83,axiom,
    ( ~ less_or_equal(X,Y)
    | less(X,Y)
    | X = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal) ).

cnf(84,axiom,
    ( less_or_equal(X,Y)
    | ~ less(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal) ).

cnf(85,axiom,
    ( less_or_equal(X,Y)
    | X != Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal) ).

cnf(86,axiom,
    ~ less(X,n0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less0) ).

cnf(87,axiom,
    ( ~ less(X,n1)
    | less_or_equal(X,n0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less1) ).

cnf(88,axiom,
    ( less(X,n1)
    | ~ less_or_equal(X,n0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less1) ).

cnf(89,axiom,
    ( ~ less(X,n2)
    | less_or_equal(X,n1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less2) ).

cnf(90,axiom,
    ( less(X,n2)
    | ~ less_or_equal(X,n1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less2) ).

cnf(92,axiom,
    ( less(X,n3)
    | ~ less_or_equal(X,n2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less3) ).

cnf(105,axiom,
    ( ~ less(X,Y)
    | ~ less(Y,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).

cnf(106,axiom,
    ( ~ less(X,Y)
    | X != Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).

cnf(107,axiom,
    ( less(X,Y)
    | less(Y,X)
    | X = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).

cnf(108,hypothesis,
    holdsAt(waterLevel(n0),n0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',waterLevel_0) ).

cnf(114,negated_conjecture,
    ~ holdsAt(waterLevel(n2),n2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',waterLevel_2) ).

cnf(115,plain,
    less_or_equal(X,X),
    inference('HYPERRESOLVE',[status(thm)],[85,theory(equality)]) ).

cnf(130,plain,
    happens(tapOn,n0),
    inference('HYPERRESOLVE',[status(thm)],[61,theory(equality),theory(equality)]) ).

cnf(140,plain,
    ( less(n1,X)
    | X = n1
    | less_or_equal(X,n0) ),
    inference('HYPERRESOLVE',[status(thm)],[87,107]) ).

cnf(144,plain,
    initiates(tapOn,filling,X),
    inference('HYPERRESOLVE',[status(thm)],[43,theory(equality),theory(equality)]) ).

cnf(177,plain,
    trajectory(filling,n0,waterLevel(n1),n1),
    inference('HYPERRESOLVE',[status(thm)],[63,108,74]) ).

cnf(178,plain,
    trajectory(filling,n0,waterLevel(n2),n2),
    inference('HYPERRESOLVE',[status(thm)],[63,108,75]) ).

cnf(215,plain,
    less(n2,n3),
    inference('HYPERRESOLVE',[status(thm)],[92,115]) ).

cnf(218,plain,
    less(n0,n1),
    inference('HYPERRESOLVE',[status(thm)],[88,115]) ).

cnf(249,plain,
    ~ less(n3,n2),
    inference('UR-RESOLVE',[status(thm)],[105,215]) ).

cnf(256,plain,
    less_or_equal(n0,n1),
    inference('HYPERRESOLVE',[status(thm)],[84,218]) ).

cnf(257,plain,
    n0 != n1,
    inference('UR-RESOLVE',[status(thm)],[106,218]) ).

cnf(280,plain,
    ~ less_or_equal(n3,n1),
    inference('UR-RESOLVE',[status(thm)],[90,249]) ).

cnf(287,plain,
    less(n0,n2),
    inference('HYPERRESOLVE',[status(thm)],[90,256]) ).

cnf(321,plain,
    n3 != n1,
    inference('UR-RESOLVE',[status(thm)],[85,280]) ).

cnf(338,plain,
    ( stoppedIn(n0,filling,n1)
    | holdsAt(waterLevel(n1),n1) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[11,177,130,144,218]),74,theory(equality)]) ).

cnf(339,plain,
    stoppedIn(n0,filling,n2),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[11,178,130,144,287]),114,75,theory(equality)]) ).

cnf(375,plain,
    less('SKOLEMAAAV2'(n0,n2,filling),n2),
    inference('HYPERRESOLVE',[status(thm)],[3,339]) ).

cnf(376,plain,
    less(n0,'SKOLEMAAAV2'(n0,n2,filling)),
    inference('HYPERRESOLVE',[status(thm)],[2,339]) ).

cnf(377,plain,
    happens('SKOLEMAAAV1'(n0,n2,filling),'SKOLEMAAAV2'(n0,n2,filling)),
    inference('HYPERRESOLVE',[status(thm)],[1,339]) ).

cnf(519,plain,
    ( less(n1,X)
    | X = n1
    | X = n0 ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[83,140]),86]) ).

cnf(558,plain,
    ( holdsAt(waterLevel(n1),n1)
    | less('SKOLEMAAAV2'(n0,n1,filling),n1) ),
    inference('HYPERRESOLVE',[status(thm)],[3,338]) ).

cnf(559,plain,
    ( holdsAt(waterLevel(n1),n1)
    | less(n0,'SKOLEMAAAV2'(n0,n1,filling)) ),
    inference('HYPERRESOLVE',[status(thm)],[2,338]) ).

cnf(565,plain,
    less_or_equal('SKOLEMAAAV2'(n0,n2,filling),n1),
    inference('HYPERRESOLVE',[status(thm)],[89,375]) ).

cnf(569,plain,
    n0 != 'SKOLEMAAAV2'(n0,n2,filling),
    inference('UR-RESOLVE',[status(thm)],[106,376]) ).

cnf(631,plain,
    ( less('SKOLEMAAAV2'(n0,n2,filling),n1)
    | 'SKOLEMAAAV2'(n0,n2,filling) = n1 ),
    inference('HYPERRESOLVE',[status(thm)],[83,565]) ).

cnf(635,plain,
    ~ less_or_equal('SKOLEMAAAV2'(n0,n2,filling),n0),
    inference('UR-RESOLVE',[status(thm)],[83,569,86]) ).

cnf(692,plain,
    ~ less('SKOLEMAAAV2'(n0,n2,filling),n1),
    inference('UR-RESOLVE',[status(thm)],[87,635]) ).

cnf(693,plain,
    'SKOLEMAAAV2'(n0,n2,filling) = n1,
    inference('REWRITE',[status(thm)],[631,692]) ).

cnf(694,plain,
    happens('SKOLEMAAAV1'(n0,n2,filling),n1),
    inference('REWRITE',[status(thm)],[377,693,theory(equality)]) ).

cnf(696,plain,
    holdsAt(waterLevel(n3),n1),
    inference('UR-RESOLVE',[status(thm)],[58,694,257]) ).

cnf(797,plain,
    ~ holdsAt(waterLevel(n1),n1),
    inference('UR-RESOLVE',[status(thm)],[64,696,321]) ).

cnf(799,plain,
    less('SKOLEMAAAV2'(n0,n1,filling),n1),
    inference('REWRITE',[status(thm)],[558,797]) ).

cnf(800,plain,
    less(n0,'SKOLEMAAAV2'(n0,n1,filling)),
    inference('REWRITE',[status(thm)],[559,797]) ).

cnf(818,plain,
    'SKOLEMAAAV2'(n0,n1,filling) != n1,
    inference('UR-RESOLVE',[status(thm)],[106,799]) ).

cnf(836,plain,
    'SKOLEMAAAV2'(n0,n1,filling) = n0,
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[105,799,519]),818]) ).

cnf(837,plain,
    $false,
    inference('REWRITE',[status(thm)],[800,86,836,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11  % Problem  : CSR008+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.05/0.12  % Command  : run-snark %s %d
% 0.11/0.32  % Computer : n017.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Fri Jun 10 05:16:50 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.18/0.42  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.43  * 
% 0.18/0.43  * 
% 0.18/0.44  #<PACKAGE "SNARK-USER">
% 0.18/0.44  * 
% 0.18/0.44  SNARK-TPTP-OPTIONS
% 0.18/0.44  * 
% 0.18/0.44  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.44   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.44   (USE-FACTORING :POS)
% 0.18/0.44   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.44   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.44   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.44   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.44   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.44   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.44   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.44   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.44   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.44   (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.44  * 
% 0.18/0.44  "."
% 0.18/0.44  * 
% 0.18/0.44  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-10T05:16:50
% 0.18/0.44  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n017.cluster.edu at 2022-06-10T05:16:50
% 0.18/0.47  
% 0.18/0.47  ; Recognized commutativity assertion (= (|plus| ?X ?Y) (|plus| ?Y ?X)).
% 0.18/0.47  WARNING:
% 0.18/0.47     |antitrajectory| is a 4-ary relation that occurs only negatively; disabling rows that contain it.
% 0.57/0.76  ; Declaring plus to be commutative.
% 0.57/0.76  
% 0.57/0.76  #||
% 0.57/0.76  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.57/0.76  % SZS output start Refutation
% See solution above
% 0.57/0.76  ||#
% 0.57/0.76  
% 0.57/0.76  ; Summary of computation:
% 0.57/0.76  ;      4156 formulas have been input or derived (from 561 formulas).
% 0.57/0.76  ;       837 (20%) were retained.  Of these,
% 0.57/0.76  ;          125 (15%) were simplified or subsumed later,
% 0.57/0.76  ;          712 (85%) are still being kept.
% 0.57/0.76  ; 
% 0.57/0.76  ; Run time in seconds excluding printing time:
% 0.57/0.76  ;     0.012   4%   Read assertion file          (1 call)
% 0.57/0.76  ;     0.004   1%   Assert                       (55 calls)
% 0.57/0.76  ;     0.060  19%   Process new row              (3,430 calls)
% 0.57/0.76  ;     0.120  38%   Resolution                   (1,120 calls)
% 0.57/0.76  ;     0.009   3%   Paramodulation               (560 calls)
% 0.57/0.76  ;     0.000   0%   Factoring                    (58 calls)
% 0.57/0.76  ;     0.002   1%   Condensing                   (560 calls)
% 0.57/0.76  ;     0.008   3%   Forward subsumption          (560 calls)
% 0.57/0.76  ;     0.004   1%   Backward subsumption         (279 calls)
% 0.57/0.76  ;     0.001   0%   Clause clause subsumption    (440 calls)
% 0.57/0.76  ;     0.039  12%   Forward simplification       (3,280 calls)
% 0.57/0.76  ;     0.010   3%   Backward simplification      (837 calls)
% 0.57/0.76  ;     0.005   2%   Ordering                     (3,254 calls)
% 0.57/0.76  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.57/0.76  ;     0.000   0%   Purity testing               (1 call)
% 0.57/0.76  ;     0.044  14%   Other
% 0.57/0.76  ;     0.318        Total
% 0.57/0.76  ;     0.322        Real time
% 0.57/0.76  ; 
% 0.57/0.76  ; Term-hash-array has 932 terms in all.
% 0.57/0.76  ; Feature-vector-row-index has 211 entries (225 at peak, 279 added, 68 deleted).
% 0.57/0.76  ; Feature-vector-row-index has 769 nodes (903 at peak, 1,168 added, 399 deleted).
% 0.57/0.76  ;  Retrieved 608 possibly forward subsuming rows in 560 calls.
% 0.57/0.76  ;  Retrieved 54 possibly backward subsumed rows in 279 calls.
% 0.57/0.76  ; Path-index has 857 entries (882 at peak, 982 added, 125 deleted).
% 0.57/0.76  ; Path-index has 964 nodes (980 at peak, 1,092 added, 128 deleted).
% 0.57/0.76  ; Trie-index has 857 entries (882 at peak, 982 added, 125 deleted).
% 0.57/0.76  ; Trie-index has 1,610 nodes (1,667 at peak, 1,935 added, 325 deleted).
% 0.57/0.76  ; Retrieved 4,217 generalization terms in 6,842 calls.
% 0.57/0.76  ; Retrieved 598 instance terms in 557 calls.
% 0.57/0.76  ; Retrieved 86,515 unifiable terms in 11,863 calls.
% 0.57/0.76  ; 
% 0.57/0.76  ; The agenda of backward simplifiable rows to process has 22 entries:
% 0.57/0.76  ;    22 with value 0
% 0.57/0.76  ; The agenda of rows to process has 24 entries:
% 0.57/0.76  ;     2 with value 21             22 with value 24
% 0.57/0.76  ; The agenda of rows to give has 198 entries:
% 0.57/0.76  ;     3 with value (4 13)         12 with value (4 18)           6 with value (4 23)
% 0.57/0.76  ;     8 with value (4 14)         48 with value (4 19)           2 with value (4 24)
% 0.57/0.76  ;     3 with value (4 15)         42 with value (4 20)           1 with value (4 25)
% 0.57/0.76  ;    43 with value (4 16)          3 with value (4 21)           4 with value (4 28)
% 0.57/0.76  ;    21 with value (4 17)          2 with value (4 22)
% 0.57/0.76  Evaluation took:
% 0.57/0.76    0.322 seconds of real time
% 0.57/0.76    0.291374 seconds of user run time
% 0.57/0.76    0.031286 seconds of system run time
% 0.57/0.76    [Run times include 0.008 seconds GC run time.]
% 0.57/0.76    0 calls to %EVAL
% 0.57/0.76    0 page faults and
% 0.57/0.76    20,215,208 bytes consed.
% 0.57/0.76  :PROOF-FOUND
% 0.57/0.76  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-10T05:16:50
% 0.57/0.76  :PROOF-FOUND
% 0.57/0.76  * 
%------------------------------------------------------------------------------