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

View Problem - Process Solution

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

% Computer : n023.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.77s 0.93s
% Output   : Refutation 0.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   25
% Syntax   : Number of clauses     :   63 (  37 unt;  10 nHn;  57 RR)
%            Number of literals    :  102 (  24 equ;  40 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('SKOLEMAAAU1'(X,Z,Y),'SKOLEMAAAU2'(X,Z,Y)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax',stoppedin_defn) ).

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

cnf(3,axiom,
    ( ~ stoppedIn(X,Y,Z)
    | less('SKOLEMAAAU2'(X,Z,Y),Z) ),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/CSR001+0.ax',change_holding) ).

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

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

cnf(61,axiom,
    ( happens(X,Y)
    | X != tapOn
    | Y != n0 ),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/CSR001+1.ax',change_of_waterLevel) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(114,negated_conjecture,
    holdsAt(waterLevel(n3),n2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',waterlevel_not_3) ).

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(183,plain,
    trajectory(filling,n0,waterLevel(n1),n1),
    inference('HYPERRESOLVE',[status(thm)],[63,108,74]) ).

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

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

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

cnf(257,plain,
    n2 != n3,
    inference('UR-RESOLVE',[status(thm)],[106,224]) ).

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

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

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

cnf(288,plain,
    ~ holdsAt(waterLevel(n2),n2),
    inference('UR-RESOLVE',[status(thm)],[64,257,114]) ).

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

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

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

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

cnf(354,plain,
    stoppedIn(n0,filling,n2),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[11,184,130,144,298]),288,75,theory(equality)]) ).

cnf(392,plain,
    less('SKOLEMAAAU2'(n0,n2,filling),n2),
    inference('HYPERRESOLVE',[status(thm)],[3,354]) ).

cnf(393,plain,
    less(n0,'SKOLEMAAAU2'(n0,n2,filling)),
    inference('HYPERRESOLVE',[status(thm)],[2,354]) ).

cnf(394,plain,
    happens('SKOLEMAAAU1'(n0,n2,filling),'SKOLEMAAAU2'(n0,n2,filling)),
    inference('HYPERRESOLVE',[status(thm)],[1,354]) ).

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

cnf(581,plain,
    ( holdsAt(waterLevel(n1),n1)
    | less('SKOLEMAAAU2'(n0,n1,filling),n1) ),
    inference('HYPERRESOLVE',[status(thm)],[3,353]) ).

cnf(582,plain,
    ( holdsAt(waterLevel(n1),n1)
    | less(n0,'SKOLEMAAAU2'(n0,n1,filling)) ),
    inference('HYPERRESOLVE',[status(thm)],[2,353]) ).

cnf(588,plain,
    less_or_equal('SKOLEMAAAU2'(n0,n2,filling),n1),
    inference('HYPERRESOLVE',[status(thm)],[89,392]) ).

cnf(592,plain,
    n0 != 'SKOLEMAAAU2'(n0,n2,filling),
    inference('UR-RESOLVE',[status(thm)],[106,393]) ).

cnf(683,plain,
    ( less('SKOLEMAAAU2'(n0,n2,filling),n1)
    | 'SKOLEMAAAU2'(n0,n2,filling) = n1 ),
    inference('HYPERRESOLVE',[status(thm)],[83,588]) ).

cnf(687,plain,
    ~ less_or_equal('SKOLEMAAAU2'(n0,n2,filling),n0),
    inference('UR-RESOLVE',[status(thm)],[83,592,86]) ).

cnf(1038,plain,
    ~ less('SKOLEMAAAU2'(n0,n2,filling),n1),
    inference('UR-RESOLVE',[status(thm)],[87,687]) ).

cnf(1039,plain,
    'SKOLEMAAAU2'(n0,n2,filling) = n1,
    inference('REWRITE',[status(thm)],[683,1038]) ).

cnf(1040,plain,
    happens('SKOLEMAAAU1'(n0,n2,filling),n1),
    inference('REWRITE',[status(thm)],[394,1039,theory(equality)]) ).

cnf(1042,plain,
    holdsAt(waterLevel(n3),n1),
    inference('UR-RESOLVE',[status(thm)],[58,1040,266]) ).

cnf(1169,plain,
    ~ holdsAt(waterLevel(n1),n1),
    inference('UR-RESOLVE',[status(thm)],[64,1042,336]) ).

cnf(1171,plain,
    less('SKOLEMAAAU2'(n0,n1,filling),n1),
    inference('REWRITE',[status(thm)],[581,1169]) ).

cnf(1172,plain,
    less(n0,'SKOLEMAAAU2'(n0,n1,filling)),
    inference('REWRITE',[status(thm)],[582,1169]) ).

cnf(1181,plain,
    'SKOLEMAAAU2'(n0,n1,filling) != n1,
    inference('UR-RESOLVE',[status(thm)],[106,1171]) ).

cnf(1199,plain,
    'SKOLEMAAAU2'(n0,n1,filling) = n0,
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[105,1171,538]),1181]) ).

cnf(1200,plain,
    $false,
    inference('REWRITE',[status(thm)],[1172,86,1199,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : CSR007+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.04/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n023.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 : Fri Jun 10 21:47:52 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47  * 
% 0.19/0.47  * 
% 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.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48   (USE-FACTORING :POS)
% 0.19/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48  * 
% 0.19/0.48  "."
% 0.19/0.48  * 
% 0.19/0.48  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-10T21:47:52
% 0.19/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n023.cluster.edu at 2022-06-10T21:47:52
% 0.19/0.50  
% 0.19/0.50  ; Recognized commutativity assertion (= (|plus| ?X ?Y) (|plus| ?Y ?X)).
% 0.19/0.50  WARNING:
% 0.19/0.50     |antitrajectory| is a 4-ary relation that occurs only negatively; disabling rows that contain it.
% 0.77/0.93  ; Declaring plus to be commutative.
% 0.77/0.93  
% 0.77/0.93  #||
% 0.77/0.93  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.77/0.93  % SZS output start Refutation
% See solution above
% 0.77/0.93  ||#
% 0.77/0.93  
% 0.77/0.93  ; Summary of computation:
% 0.77/0.93  ;      5586 formulas have been input or derived (from 584 formulas).
% 0.77/0.93  ;      1200 (21%) were retained.  Of these,
% 0.77/0.93  ;          468 (39%) were simplified or subsumed later,
% 0.77/0.93  ;          732 (61%) are still being kept.
% 0.77/0.93  ; 
% 0.77/0.93  ; Run time in seconds excluding printing time:
% 0.77/0.93  ;     0.012   3%   Read assertion file          (1 call)
% 0.77/0.93  ;     0.004   1%   Assert                       (55 calls)
% 0.77/0.93  ;     0.057  13%   Process new row              (4,818 calls)
% 0.77/0.93  ;     0.132  29%   Resolution                   (1,166 calls)
% 0.77/0.93  ;     0.015   3%   Paramodulation               (583 calls)
% 0.77/0.93  ;     0.000   0%   Factoring                    (65 calls)
% 0.77/0.93  ;     0.010   2%   Condensing                   (1,483 calls)
% 0.77/0.93  ;     0.055  12%   Forward subsumption          (1,483 calls)
% 0.77/0.93  ;     0.012   3%   Backward subsumption         (621 calls)
% 0.77/0.93  ;     0.006   1%   Clause clause subsumption    (1,212 calls)
% 0.77/0.93  ;     0.065  14%   Forward simplification       (4,599 calls)
% 0.77/0.93  ;     0.020   4%   Backward simplification      (1,200 calls)
% 0.77/0.93  ;     0.012   3%   Ordering                     (4,939 calls)
% 0.77/0.93  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.77/0.93  ;     0.001   0%   Purity testing               (1 call)
% 0.77/0.93  ;     0.051  11%   Other
% 0.77/0.93  ;     0.452        Total
% 0.77/0.93  ;     0.455        Real time
% 0.77/0.93  ; 
% 0.77/0.93  ; Term-hash-array has 1,029 terms in all.
% 0.77/0.93  ; Feature-vector-row-index has 214 entries (520 at peak, 621 added, 407 deleted).
% 0.77/0.93  ; Feature-vector-row-index has 794 nodes (2,922 at peak, 3,353 added, 2,559 deleted).
% 0.77/0.93  ;  Retrieved 2,389 possibly forward subsuming rows in 1,483 calls.
% 0.77/0.93  ;  Retrieved 251 possibly backward subsumed rows in 621 calls.
% 0.77/0.93  ; Path-index has 881 entries (925 at peak, 1,121 added, 240 deleted).
% 0.77/0.93  ; Path-index has 981 nodes (997 at peak, 1,147 added, 166 deleted).
% 0.77/0.93  ; Trie-index has 881 entries (925 at peak, 1,121 added, 240 deleted).
% 0.77/0.93  ; Trie-index has 1,667 nodes (1,724 at peak, 2,165 added, 498 deleted).
% 0.77/0.93  ; Retrieved 6,129 generalization terms in 12,438 calls.
% 0.77/0.93  ; Retrieved 621 instance terms in 578 calls.
% 0.77/0.93  ; Retrieved 97,153 unifiable terms in 13,259 calls.
% 0.77/0.93  ; 
% 0.77/0.93  ; The agenda of backward simplifiable rows to process has 22 entries:
% 0.77/0.93  ;    22 with value 0
% 0.77/0.93  ; The agenda of rows to process has 24 entries:
% 0.77/0.93  ;     2 with value 21             22 with value 24
% 0.77/0.93  ; The agenda of rows to give has 202 entries:
% 0.77/0.93  ;     6 with value (4 13)         13 with value (4 18)           7 with value (4 23)
% 0.77/0.93  ;    13 with value (4 14)         47 with value (4 19)           2 with value (4 24)
% 0.77/0.93  ;     1 with value (4 15)         41 with value (4 20)           2 with value (4 25)
% 0.77/0.93  ;    39 with value (4 16)          3 with value (4 21)           4 with value (4 28)
% 0.77/0.93  ;    22 with value (4 17)          2 with value (4 22)
% 0.77/0.93  Evaluation took:
% 0.77/0.93    0.455 seconds of real time
% 0.77/0.93    0.402374 seconds of user run time
% 0.77/0.93    0.053355 seconds of system run time
% 0.77/0.93    [Run times include 0.013 seconds GC run time.]
% 0.77/0.93    0 calls to %EVAL
% 0.77/0.93    0 page faults and
% 0.77/0.93    32,531,928 bytes consed.
% 0.77/0.93  :PROOF-FOUND
% 0.77/0.93  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-10T21:47:53
% 0.77/0.93  :PROOF-FOUND
% 0.77/0.93  * 
%------------------------------------------------------------------------------