TSTP Solution File: CSR002+2 by SNARK---20120808r022

View Problem - Process Solution

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

% Computer : n025.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:57 EDT 2022

% Result   : Theorem 0.49s 0.69s
% Output   : Refutation 0.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   23
% Syntax   : Number of clauses     :   45 (  26 unt;   5 nHn;  40 RR)
%            Number of literals    :   79 (  16 equ;  45 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;   8 con; 0-2 aty)
%            Number of variables   :   45 (  10 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(14,axiom,
    ( holdsAt(X,Y)
    | releasedAt(X,plus(Y,n1))
    | happens('SKOLEMAAAV6'(Y,X),Y)
    | ~ holdsAt(X,plus(Y,n1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',keep_not_holding) ).

cnf(19,axiom,
    ( releasedAt(X,Y)
    | releases('SKOLEMAAAV8'(Y,X),X,Y)
    | ~ releasedAt(X,plus(Y,n1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',keep_not_released) ).

cnf(21,axiom,
    ( ~ happens(X,Y)
    | ~ terminates(X,Z,Y)
    | ~ holdsAt(Z,plus(Y,n1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',happens_terminates_not_holds) ).

cnf(23,axiom,
    ( ~ happens(X,Y)
    | ~ initiates(X,Z,Y)
    | ~ releasedAt(Z,plus(Y,n1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',happens_not_released) ).

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

cnf(51,axiom,
    ( terminates(X,Y,Z)
    | X != overflow
    | Y != filling ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',terminates_all_defn) ).

cnf(53,axiom,
    ( ~ releases(X,Y,Z)
    | Y = waterLevel('SKOLEMAAAV11'(X,Y)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',releases_all_defn) ).

cnf(59,axiom,
    ( ~ happens(X,Y)
    | Y = n0
    | holdsAt(filling,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(62,axiom,
    ( happens(X,Y)
    | ~ holdsAt(waterLevel(n3),Y)
    | ~ holdsAt(filling,Y)
    | X != overflow ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',happens_all_defn) ).

cnf(68,axiom,
    filling != waterLevel(X),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',filling_not_waterLevel) ).

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

cnf(77,axiom,
    plus(n1,n1) = n2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_1) ).

cnf(78,axiom,
    plus(n1,n2) = n3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_2) ).

cnf(79,axiom,
    plus(n1,n3) = n4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_3) ).

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(88,axiom,
    ( less(X,n1)
    | ~ less_or_equal(X,n0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less1) ).

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(114,axiom,
    holdsAt(waterLevel(n3),n3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',waterLevel_3) ).

cnf(115,negated_conjecture,
    holdsAt(filling,n4),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_filling_4) ).

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

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

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

cnf(149,plain,
    terminates(overflow,filling,X),
    inference('HYPERRESOLVE',[status(thm)],[51,theory(equality),theory(equality)]) ).

cnf(150,plain,
    ~ releases(X,filling,Y),
    inference('UR-RESOLVE',[status(thm)],[53,68]) ).

cnf(156,plain,
    ( ~ happens(X,n3)
    | ~ terminates(X,Y,n3)
    | ~ holdsAt(Y,n4) ),
    inference('PARAMODULATE',[status(thm)],[21,79,theory(equality)]) ).

cnf(213,plain,
    ( holdsAt(X,n3)
    | releasedAt(X,n4)
    | happens('SKOLEMAAAV6'(n3,X),n3)
    | ~ holdsAt(X,n4) ),
    inference('PARAMODULATE',[status(thm)],[14,79,theory(equality)]) ).

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

cnf(242,plain,
    ~ releasedAt(filling,n1),
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[23,145,131]),74,theory(equality)]) ).

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

cnf(272,plain,
    ~ releasedAt(filling,n2),
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[19,242,150]),77,theory(equality)]) ).

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

cnf(305,plain,
    ~ releasedAt(filling,n3),
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[19,272,150]),78,theory(equality)]) ).

cnf(340,plain,
    ~ less(n3,n1),
    inference('UR-RESOLVE',[status(thm)],[84,293]) ).

cnf(345,plain,
    ~ releasedAt(filling,n4),
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[19,305,150]),79,theory(equality)]) ).

cnf(377,plain,
    ~ less_or_equal(n3,n0),
    inference('UR-RESOLVE',[status(thm)],[88,340]) ).

cnf(412,plain,
    n3 != n0,
    inference('UR-RESOLVE',[status(thm)],[85,377]) ).

cnf(572,plain,
    ~ happens(overflow,n3),
    inference('UR-RESOLVE',[status(thm)],[156,149,115]) ).

cnf(573,plain,
    ~ holdsAt(filling,n3),
    inference('UR-RESOLVE',[status(thm)],[62,572,114,theory(equality)]) ).

cnf(574,plain,
    ~ happens(X,n3),
    inference('UR-RESOLVE',[status(thm)],[59,573,412]) ).

cnf(575,plain,
    ( holdsAt(X,n3)
    | releasedAt(X,n4)
    | ~ holdsAt(X,n4) ),
    inference('REWRITE',[status(thm)],[213,574]) ).

cnf(578,plain,
    $false,
    inference('UR-RESOLVE',[status(thm)],[575,573,345,115]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CSR002+2 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n025.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 Jun 11 17:40:52 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47  * 
% 0.19/0.47  * 
% 0.19/0.48  #<PACKAGE "SNARK-USER">
% 0.19/0.48  * 
% 0.19/0.48  SNARK-TPTP-OPTIONS
% 0.19/0.48  * 
% 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/sandbox/benchmark/theBenchmark.p 2022-06-11T17:40: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 n025.cluster.edu at 2022-06-11T17:40:52
% 0.19/0.50  
% 0.19/0.51  ; Recognized commutativity assertion (= (|plus| ?X ?Y) (|plus| ?Y ?X)).
% 0.19/0.51  WARNING:
% 0.19/0.51     |antitrajectory| is a 4-ary relation that occurs only negatively; disabling rows that contain it.
% 0.49/0.69  ; Declaring plus to be commutative.
% 0.49/0.69  
% 0.49/0.69  #||
% 0.49/0.69  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.49/0.69  % SZS output start Refutation
% See solution above
% 0.49/0.70  ||#
% 0.49/0.70  
% 0.49/0.70  ; Summary of computation:
% 0.49/0.70  ;      2187 formulas have been input or derived (from 419 formulas).
% 0.49/0.70  ;       578 (26%) were retained.  Of these,
% 0.49/0.70  ;           36 ( 6%) were simplified or subsumed later,
% 0.49/0.70  ;          542 (94%) are still being kept.
% 0.49/0.70  ; 
% 0.49/0.70  ; Run time in seconds excluding printing time:
% 0.49/0.70  ;     0.012   6%   Read assertion file          (1 call)
% 0.49/0.70  ;     0.004   2%   Assert                       (56 calls)
% 0.49/0.70  ;     0.040  19%   Process new row              (1,804 calls)
% 0.49/0.70  ;     0.071  34%   Resolution                   (836 calls)
% 0.49/0.70  ;     0.007   3%   Paramodulation               (418 calls)
% 0.49/0.70  ;     0.000   0%   Factoring                    (20 calls)
% 0.49/0.70  ;     0.006   3%   Condensing                   (292 calls)
% 0.49/0.70  ;     0.003   1%   Forward subsumption          (292 calls)
% 0.49/0.70  ;     0.007   3%   Backward subsumption         (208 calls)
% 0.49/0.70  ;     0.000   0%   Clause clause subsumption    (163 calls)
% 0.49/0.70  ;     0.024  11%   Forward simplification       (1,803 calls)
% 0.49/0.70  ;     0.004   2%   Backward simplification      (578 calls)
% 0.49/0.70  ;     0.003   1%   Ordering                     (1,215 calls)
% 0.49/0.70  ;     0.001   0%   Sortal reasoning             (32 calls)
% 0.49/0.70  ;     0.001   0%   Purity testing               (1 call)
% 0.49/0.70  ;     0.028  13%   Other
% 0.49/0.70  ;     0.211        Total
% 0.49/0.70  ;     0.222        Real time
% 0.49/0.70  ; 
% 0.49/0.70  ; Term-hash-array has 688 terms in all.
% 0.49/0.70  ; Feature-vector-row-index has 179 entries (184 at peak, 208 added, 29 deleted).
% 0.49/0.70  ; Feature-vector-row-index has 746 nodes (768 at peak, 894 added, 148 deleted).
% 0.49/0.70  ;  Retrieved 167 possibly forward subsuming rows in 292 calls.
% 0.49/0.70  ;  Retrieved 47 possibly backward subsumed rows in 208 calls.
% 0.49/0.70  ; Path-index has 679 entries (690 at peak, 724 added, 45 deleted).
% 0.49/0.70  ; Path-index has 735 nodes (743 at peak, 775 added, 40 deleted).
% 0.49/0.70  ; Trie-index has 679 entries (690 at peak, 724 added, 45 deleted).
% 0.49/0.70  ; Trie-index has 1,208 nodes (1,229 at peak, 1,306 added, 98 deleted).
% 0.49/0.70  ; Retrieved 1,977 generalization terms in 3,145 calls.
% 0.49/0.70  ; Retrieved 411 instance terms in 369 calls.
% 0.49/0.70  ; Retrieved 56,266 unifiable terms in 7,246 calls.
% 0.49/0.70  ; 
% 0.49/0.70  ; The agenda of rows to process has 4 entries:
% 0.49/0.70  ;     1 with value 8               3 with value 10
% 0.49/0.70  ; The agenda of rows to give has 132 entries:
% 0.49/0.70  ;    32 with value (4 14)          9 with value (4 18)           6 with value (4 23)
% 0.49/0.70  ;    25 with value (4 15)         16 with value (4 19)           2 with value (4 25)
% 0.49/0.70  ;    16 with value (4 16)          4 with value (4 20)           1 with value (4 27)
% 0.49/0.70  ;    18 with value (4 17)          3 with value (4 21)
% 0.49/0.70  Evaluation took:
% 0.49/0.70    0.222 seconds of real time
% 0.49/0.70    0.203383 seconds of user run time
% 0.49/0.70    0.018858 seconds of system run time
% 0.49/0.70    [Run times include 0.008 seconds GC run time.]
% 0.49/0.70    0 calls to %EVAL
% 0.49/0.70    0 page faults and
% 0.49/0.70    12,774,944 bytes consed.
% 0.49/0.70  :PROOF-FOUND
% 0.49/0.70  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-11T17:40:52
% 0.49/0.70  :PROOF-FOUND
% 0.49/0.70  * 
%------------------------------------------------------------------------------