%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SWX153_1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n024.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 May 5 07:07:08 PM UTC 2026
% Result : Theorem 0.14s 0.34s
% Output : Refutation 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 'CODE-FOR-$$SUM')
% Comments :
%------------------------------------------------------------------------------
cnf('$$GREATEREQ-IS-REFLEXIVE',axiom,
$greatereq(X,X) ).
tff(28,axiom,
! [X: $int,Y: $int] :
( ~ sl1sl2(X,Y)
| w1sl2($sum(Y,1),Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax10) ).
tff(29,plain,
! [X: $int,Y: $int] :
( ~ sl1sl2(X,Y)
| w1sl2($sum(1,Y),Y) ),
inference('REWRITE',[status(thm)],[28,'CODE-FOR-$$SUM']) ).
tff(30,axiom,
! [X: $int,Y: $int] :
( ~ w1sl2(X,Y)
| ( Y != 0 )
| cr1sl2(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax11) ).
tff(36,axiom,
! [X: $int,Y: $int] :
( ~ cr1sl2(X,Y)
| cr1w2(X,$sum(X,1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax14) ).
tff(37,plain,
! [X: $int,Y: $int] :
( ~ cr1sl2(X,Y)
| cr1w2(X,$sum(1,X)) ),
inference('REWRITE',[status(thm)],[36,'CODE-FOR-$$SUM']) ).
tff(43,negated_conjecture,
! [X: $int,Y: $int] :
( ~ $greatereq(X,0)
| ~ $greatereq(Y,0)
| sl1sl2(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj1) ).
tff(44,negated_conjecture,
! [X: $int,Y: $int] : ~ cr1w2(X,Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj1) ).
tff(45,plain,
! [X: $int,Y: $int] : ~ cr1sl2(X,Y),
inference('REWRITE',[status(thm)],[37,44]) ).
tff(46,plain,
! [X: $int,Y: $int] :
( ~ w1sl2(X,Y)
| ( Y != 0 ) ),
inference('REWRITE',[status(thm)],[30,45]) ).
tff(53,plain,
! [X: $int] : ~ w1sl2(X,0),
inference('UR-RESOLVE',[status(thm)],[46,theory(equality)]) ).
tff(63,plain,
sl1sl2(0,0),
inference('HYPERRESOLVE',[status(thm)],[43,'$$GREATEREQ-IS-REFLEXIVE','$$GREATEREQ-IS-REFLEXIVE']) ).
tff(67,plain,
! [X: $int] : ~ sl1sl2(X,0),
inference('UR-RESOLVE',[status(thm)],[29,53]) ).
cnf(68,plain,
$false,
inference('REWRITE',[status(thm)],[63,67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : SWX153_1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.07 % Command : run-snark %s %d
% 0.07/0.25 % Computer : n024.cluster.edu
% 0.07/0.25 % Model : x86_64 x86_64
% 0.07/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.25 % Memory : 8042.1875MB
% 0.07/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.25 % CPULimit : 300
% 0.07/0.25 % WCLimit : 300
% 0.07/0.25 % DateTime : Tue May 5 03:57:26 EDT 2026
% 0.07/0.25 % CPUTime :
% 0.07/0.31 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.32 *
% 0.07/0.32 *
% 0.07/0.32 #<PACKAGE "SNARK-USER">
% 0.07/0.32 *
% 0.07/0.32 SNARK-TPTP-OPTIONS
% 0.07/0.32 *
% 0.07/0.32 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.07/0.32 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.07/0.32 (USE-FACTORING :POS)
% 0.07/0.32 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.07/0.32 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.07/0.32 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.07/0.32 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.07/0.32 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.07/0.32 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.07/0.32 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.07/0.32 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.07/0.32 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.07/0.32 (DECLARE-TPTP-SYMBOLS2))
% 0.07/0.32 *
% 0.07/0.32 "."
% 0.07/0.32 *
% 0.07/0.32 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2026-05-05T03:57:26
% 0.07/0.32 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2026-05-05T03:57:26
% 0.14/0.34
% 0.14/0.34
% 0.14/0.34 #||
% 0.14/0.34 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.34 % SZS output start Refutation
% See solution above
% 0.14/0.34 ||#
% 0.14/0.34
% 0.14/0.34 ; Summary of computation:
% 0.14/0.34 ; 82 formulas have been input or derived (from 34 formulas).
% 0.14/0.34 ; 68 (83%) were retained. Of these,
% 0.14/0.34 ; 30 (44%) were simplified or subsumed later,
% 0.14/0.34 ; 38 (56%) are still being kept.
% 0.14/0.34 ;
% 0.14/0.34 ; Run time in seconds:
% 0.14/0.34 ; 0.003 14% Read assertion file (1 call)
% 0.14/0.34 ; 0.000 0% Assert (19 calls)
% 0.14/0.34 ; 0.002 10% Process new row (72 calls)
% 0.14/0.34 ; 0.000 0% Resolution (66 calls)
% 0.14/0.34 ; 0.000 0% Paramodulation (33 calls)
% 0.14/0.34 ; 0.000 0% Factoring (4 calls)
% 0.14/0.34 ; 0.000 0% Condensing (46 calls)
% 0.14/0.34 ; 0.000 0% Forward subsumption (46 calls)
% 0.14/0.34 ; 0.001 5% Backward subsumption (46 calls)
% 0.14/0.34 ; 0.000 0% Clause clause subsumption (10 calls)
% 0.14/0.34 ; 0.001 5% Forward simplification (72 calls)
% 0.14/0.34 ; 0.001 5% Backward simplification (62 calls)
% 0.14/0.34 ; 0.000 0% Sortal reasoning (115 calls)
% 0.14/0.34 ; 0.000 0% Purity testing (1 call)
% 0.14/0.34 ; 0.013 62% Other
% 0.14/0.34 ; 0.021 Total
% 0.14/0.34 ; 0.022 Real time
% 0.14/0.34 ;
% 0.14/0.34 ; Term-hash-array has 46 terms in all.
% 0.14/0.34 ; Feature-vector-row-index has 23 entries (33 at peak, 46 added, 23 deleted).
% 0.14/0.34 ; Feature-vector-row-index has 47 nodes (87 at peak, 104 added, 57 deleted).
% 0.14/0.34 ; Retrieved 9 possibly forward subsuming rows in 46 calls.
% 0.14/0.34 ; Retrieved 6 possibly backward subsumed rows in 46 calls.
% 0.14/0.34 ; Path-index has 39 entries (41 at peak, 54 added, 15 deleted).
% 0.14/0.34 ; Path-index has 99 nodes (104 at peak, 113 added, 14 deleted).
% 0.14/0.34 ; Trie-index has 39 entries (41 at peak, 54 added, 15 deleted).
% 0.14/0.34 ; Trie-index has 64 nodes (68 at peak, 81 added, 17 deleted).
% 0.14/0.34 ; Retrieved 25 generalization terms in 30 calls.
% 0.14/0.34 ; Retrieved 19 instance terms in 15 calls.
% 0.14/0.34 ; Retrieved 149 unifiable terms in 105 calls.
% 0.14/0.34 ;
% 0.14/0.34 ; The agenda of backward simplifiable rows to process has 1 entry:
% 0.14/0.34 ; 1 with value 0
% 0.14/0.34 ; The agenda of rows to give has 6 entries:
% 0.14/0.34 ; 3 with value (4 5) 1 with value (4 9) 1 with value (4 13)
% 0.14/0.34 ; 1 with value (4 6)
% 0.14/0.34 Evaluation took:
% 0.14/0.34 0.022 seconds of real time
% 0.14/0.34 0.018576 seconds of user run time
% 0.14/0.34 0.003101 seconds of system run time
% 0.14/0.34 0 calls to %EVAL
% 0.14/0.34 0 page faults and
% 0.14/0.34 2,681,704 bytes consed.
% 0.14/0.34 :PROOF-FOUND
% 0.14/0.34 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2026-05-05T03:57:26
% 0.14/0.34 :PROOF-FOUND
% 0.14/0.34 *
%------------------------------------------------------------------------------