↑ Up

SNARK---20120808r022.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : CSR310_1 : TPTP v9.0.0. Released v9.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n011.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  : 300s
% DateTime : Tue Apr  1 01:53:45 AM UTC 2025

% Result   : Theorem 0.20s 0.56s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named 'CODE-FOR-$$SUM')

% Comments : 
%------------------------------------------------------------------------------
tff(24,axiom,
    ! [X: fluent,Y: $int] :
      ( ~ holdsAt(X,at_time(Y))
      | releasedAt(X,at_time($sum(Y,1)))
      | happens('SKOLEMAAAW5.event'(Y,X),at_time(Y))
      | holdsAt(X,at_time($sum(Y,1))) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR001_0.ax',keep_holding) ).

tff(25,plain,
    ! [X: fluent,Y: $int] :
      ( ~ holdsAt(X,at_time(Y))
      | releasedAt(X,at_time($sum(1,Y)))
      | happens('SKOLEMAAAW5.event'(Y,X),at_time(Y))
      | holdsAt(X,at_time($sum(1,Y))) ),
    inference('REWRITE',[status(thm)],[24,'CODE-FOR-$$SUM']) ).

tff(38,axiom,
    ! [X: fluent,Y: $int] :
      ( releasedAt(X,at_time(Y))
      | releases('SKOLEMAAAW8.event'(Y,X),X,at_time(Y))
      | ~ releasedAt(X,at_time($sum(Y,1))) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR001_0.ax',keep_not_released) ).

tff(39,plain,
    ! [X: fluent,Y: $int] :
      ( releasedAt(X,at_time(Y))
      | releases('SKOLEMAAAW8.event'(Y,X),X,at_time(Y))
      | ~ releasedAt(X,at_time($sum(1,Y))) ),
    inference('REWRITE',[status(thm)],[38,'CODE-FOR-$$SUM']) ).

tff(46,axiom,
    ! [X: event,Y: $int,Z: fluent] :
      ( ~ happens(X,at_time(Y))
      | ~ initiates(X,Z,at_time(Y))
      | ~ releasedAt(Z,at_time($sum(Y,1))) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR001_0.ax',happens_not_released) ).

tff(47,plain,
    ! [X: event,Y: $int,Z: fluent] :
      ( ~ happens(X,at_time(Y))
      | ~ initiates(X,Z,at_time(Y))
      | ~ releasedAt(Z,at_time($sum(1,Y))) ),
    inference('REWRITE',[status(thm)],[46,'CODE-FOR-$$SUM']) ).

tff(53,axiom,
    ! [X: $int] : ( filling != waterLevel(X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR001_1.ax',filling_not_waterLevel) ).

tff(76,axiom,
    ! [X: event,Y: fluent,Z: $int] :
      ( initiates(X,Y,at_time(Z))
      | ( X != tapOn )
      | ( Y != filling ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR001_1.ax',initiates_all_defn) ).

tff(86,axiom,
    ! [X: event,Y: fluent,Z: $int] :
      ( ~ releases(X,Y,at_time(Z))
      | ( Y = waterLevel('SKOLEMAAAW11.$int'(X,Y)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR001_1.ax',releases_all_defn) ).

tff(93,axiom,
    ! [X: event,Y: $int] :
      ( ~ happens(X,at_time(Y))
      | ( Y = 0 )
      | holdsAt(waterLevel(3),at_time(Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_all_defn) ).

tff(96,axiom,
    ! [X: event,Y: $int] :
      ( happens(X,at_time(Y))
      | ( X != tapOn )
      | ( Y != 0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_all_defn) ).

tff(104,negated_conjecture,
    holdsAt(filling,at_time(3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',waterLevel_filling) ).

tff(105,negated_conjecture,
    ~ holdsAt(waterLevel(3),at_time(3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',waterLevel_filling) ).

tff(106,negated_conjecture,
    ~ holdsAt(filling,at_time(4)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',waterLevel_filling) ).

tff(112,plain,
    happens(tapOn,at_time(0)),
    inference('HYPERRESOLVE',[status(thm)],[96,theory(equality),theory(equality)]) ).

tff(113,plain,
    ! [X: $int] : initiates(tapOn,filling,at_time(X)),
    inference('HYPERRESOLVE',[status(thm)],[76,theory(equality),theory(equality)]) ).

tff(118,plain,
    ! [X: event,Y: $int] : ~ releases(X,filling,at_time(Y)),
    inference('UR-RESOLVE',[status(thm)],[86,53]) ).

tff(132,plain,
    ( releasedAt(filling,at_time(4))
    | happens('SKOLEMAAAW5.event'(3,filling),at_time(3)) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[25,104]),106,'CODE-FOR-$$SUM']) ).

tff(138,plain,
    ~ releasedAt(filling,at_time(1)),
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[47,113,112]),'CODE-FOR-$$SUM']) ).

tff(143,plain,
    ~ releasedAt(filling,at_time(2)),
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[39,138,118]),'CODE-FOR-$$SUM']) ).

tff(152,plain,
    ~ releasedAt(filling,at_time(3)),
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[39,143,118]),'CODE-FOR-$$SUM']) ).

tff(157,plain,
    ~ releasedAt(filling,at_time(4)),
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[39,152,118]),'CODE-FOR-$$SUM']) ).

tff(158,plain,
    happens('SKOLEMAAAW5.event'(3,filling),at_time(3)),
    inference('REWRITE',[status(thm)],[132,157]) ).

cnf(160,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[93,158,105]),theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12  % Problem  : CSR310_1 : TPTP v9.0.0. Released v9.1.0.
% 0.13/0.13  % Command  : run-snark %s %d
% 0.14/0.35  % Computer : n011.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Mon Mar 31 16:20:48 EDT 2025
% 0.14/0.35  % CPUTime  : 
% 0.20/0.47  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48  * 
% 0.20/0.48  * 
% 0.20/0.49  #<PACKAGE "SNARK-USER">
% 0.20/0.49  * 
% 0.20/0.49  SNARK-TPTP-OPTIONS
% 0.20/0.49  * 
% 0.20/0.49  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49   (USE-FACTORING :POS)
% 0.20/0.49   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49  * 
% 0.20/0.49  "."
% 0.20/0.49  * 
% 0.20/0.49  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2025-03-31T16:20:48
% 0.20/0.49  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n011.cluster.edu at 2025-03-31T16:20:48
% 0.20/0.52  WARNING:
% 0.20/0.52     |antitrajectory| is a 4-ary relation that occurs only negatively; disabling rows that contain it.
% 0.20/0.56  
% 0.20/0.56  
% 0.20/0.56  #||
% 0.20/0.56  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.56  % SZS output start Refutation
% See solution above
% 0.20/0.57  ||#
% 0.20/0.57  
% 0.20/0.57  ; Summary of computation:
% 0.20/0.57  ;       355 formulas have been input or derived (from 127 formulas).
% 0.20/0.57  ;       160 (45%) were retained.  Of these,
% 0.20/0.57  ;           20 (12%) were simplified or subsumed later,
% 0.20/0.57  ;          140 (88%) are still being kept.
% 0.20/0.57  ; 
% 0.20/0.57  ; Run time in seconds excluding printing time:
% 0.20/0.57  ;     0.014  18%   Read assertion file          (1 call)
% 0.20/0.57  ;     0.004   5%   Assert                       (32 calls)
% 0.20/0.57  ;     0.009  12%   Process new row              (300 calls)
% 0.20/0.57  ;     0.013  17%   Resolution                   (252 calls)
% 0.20/0.57  ;     0.001   1%   Paramodulation               (126 calls)
% 0.20/0.57  ;     0.000   0%   Factoring                    (4 calls)
% 0.20/0.57  ;     0.001   1%   Condensing                   (92 calls)
% 0.20/0.57  ;     0.001   1%   Forward subsumption          (92 calls)
% 0.20/0.57  ;     0.002   3%   Backward subsumption         (86 calls)
% 0.20/0.57  ;     0.001   1%   Clause clause subsumption    (16 calls)
% 0.20/0.57  ;     0.004   5%   Forward simplification       (299 calls)
% 0.20/0.57  ;     0.002   3%   Backward simplification      (147 calls)
% 0.20/0.57  ;     0.000   0%   Ordering                     (117 calls)
% 0.20/0.57  ;     0.001   1%   Sortal reasoning             (780 calls)
% 0.20/0.57  ;     0.000   0%   Purity testing               (1 call)
% 0.20/0.57  ;     0.023  30%   Other
% 0.20/0.57  ;     0.076        Total
% 0.20/0.57  ;     0.079        Real time
% 0.20/0.57  ; 
% 0.20/0.57  ; Term-hash-array has 190 terms in all.
% 0.20/0.57  ; Feature-vector-row-index has 79 entries (81 at peak, 86 added, 7 deleted).
% 0.20/0.57  ; Feature-vector-row-index has 516 nodes (541 at peak, 599 added, 83 deleted).
% 0.20/0.57  ;  Retrieved 12 possibly forward subsuming rows in 92 calls.
% 0.20/0.57  ;  Retrieved 6 possibly backward subsumed rows in 86 calls.
% 0.20/0.57  ; Path-index has 195 entries (196 at peak, 215 added, 20 deleted).
% 0.20/0.57  ; Path-index has 524 nodes (525 at peak, 549 added, 25 deleted).
% 0.20/0.57  ; Trie-index has 195 entries (196 at peak, 215 added, 20 deleted).
% 0.20/0.57  ; Trie-index has 528 nodes (529 at peak, 574 added, 46 deleted).
% 0.20/0.57  ; Retrieved 253 generalization terms in 570 calls.
% 0.20/0.57  ; Retrieved 61 instance terms in 60 calls.
% 0.20/0.57  ; Retrieved 9,035 unifiable terms in 1,521 calls.
% 0.20/0.57  ; 
% 0.20/0.57  ; The agenda of rows to process has 7 entries:
% 0.20/0.57  ;     1 with value 9               2 with value 13               2 with value 16
% 0.20/0.57  ;     1 with value 12              1 with value 15
% 0.20/0.57  ; The agenda of rows to give has 13 entries:
% 0.20/0.57  ;     2 with value (4 10)          2 with value (4 15)           1 with value (4 20)
% 0.20/0.57  ;     2 with value (4 11)          1 with value (4 17)           1 with value (4 21)
% 0.20/0.57  ;     1 with value (4 14)          2 with value (4 18)           1 with value (4 22)
% 0.20/0.57  Evaluation took:
% 0.20/0.57    0.079 seconds of real time
% 0.20/0.57    0.073234 seconds of user run time
% 0.20/0.57    0.005994 seconds of system run time
% 0.20/0.57    0 calls to %EVAL
% 0.20/0.57    0 page faults and
% 0.20/0.57    6,067,728 bytes consed.
% 0.20/0.57  :PROOF-FOUND
% 0.20/0.57  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2025-03-31T16:20:48
% 0.20/0.57  :PROOF-FOUND
% 0.20/0.57  * 
%------------------------------------------------------------------------------