%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : DAT002_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n013.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 : Sat Jul 16 01:27:07 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 'CODE-FOR-$$SUM')
% Comments :
%------------------------------------------------------------------------------
tff('SOLVE-$$LESS-BY-$$$LESS',axiom,
! [X: 'NUMBER',Y: 'NUMBER'] :
( $less(X,Y)
| ~ '$$$LESS'(X,Y) ) ).
tff('SOLVE-$$GREATEREQ-BY-$$$LESS',axiom,
! [X: 'NUMBER',Y: 'NUMBER'] :
( $greatereq(X,Y)
| '$$$LESS'(X,Y) ) ).
tff(15,axiom,
! [X: $int,Y: $int] :
( ~ $less(X,Y)
| fib_sorted(mycons(X,mycons(Y,nil))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',double_is_fib_sorted_if_ordered) ).
tff(16,axiom,
! [X: $int,Y: $int,Z: $int,U: list] :
( ~ $less(X,Y)
| ~ $greatereq(Z,$sum(X,Y))
| ~ fib_sorted(mycons(Y,mycons(Z,U)))
| fib_sorted(mycons(X,mycons(Y,mycons(Z,U)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',recursive_fib_sort) ).
tff(17,negated_conjecture,
~ fib_sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',check_list) ).
tff(18,plain,
! [X: $int,Y: $int] :
( ~ '$$$LESS'(X,Y)
| fib_sorted(mycons(X,mycons(Y,nil))) ),
inference('HYPERRESOLVE',[status(thm)],[15,'SOLVE-$$LESS-BY-$$$LESS']) ).
tff(20,plain,
! [X: $int,Y: $int,Z: $int] :
( ~ '$$$LESS'(X,Y)
| ~ '$$$LESS'(Z,X)
| '$$$LESS'(Y,$sum(Z,X))
| fib_sorted(mycons(Z,mycons(X,mycons(Y,nil)))) ),
inference('HYPERRESOLVE',[status(thm)],[16,18,'SOLVE-$$LESS-BY-$$$LESS','SOLVE-$$GREATEREQ-BY-$$$LESS']) ).
tff(23,plain,
! [X: $int,Y: $int,Z: $int,U: $int] :
( ~ '$$$LESS'(X,Y)
| ~ '$$$LESS'(Z,X)
| '$$$LESS'(Y,$sum(Z,X))
| ~ '$$$LESS'(U,Z)
| '$$$LESS'(X,$sum(U,Z))
| fib_sorted(mycons(U,mycons(Z,mycons(X,mycons(Y,nil))))) ),
inference('HYPERRESOLVE',[status(thm)],[16,20,'SOLVE-$$LESS-BY-$$$LESS','SOLVE-$$GREATEREQ-BY-$$$LESS']) ).
tff(29,plain,
! [X: $int,Y: $int,Z: $int,U: $int,V: $int] :
( ~ '$$$LESS'(X,Y)
| ~ '$$$LESS'(Z,X)
| '$$$LESS'(Y,$sum(Z,X))
| ~ '$$$LESS'(U,Z)
| '$$$LESS'(X,$sum(U,Z))
| ~ '$$$LESS'(V,U)
| '$$$LESS'(Z,$sum(V,U))
| fib_sorted(mycons(V,mycons(U,mycons(Z,mycons(X,mycons(Y,nil)))))) ),
inference('HYPERRESOLVE',[status(thm)],[16,23,'SOLVE-$$LESS-BY-$$$LESS','SOLVE-$$GREATEREQ-BY-$$$LESS']) ).
cnf(39,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[17,29]),'CODE-FOR-$$SUM','CODE-FOR-$$$LESS']) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT002_1 : TPTP v8.1.0. Released v5.0.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 1 17:10:44 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T17:10:44
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n013.cluster.edu at 2022-07-01T17:10:44
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53 #||
% 0.20/0.53 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.53 % SZS output start Refutation
% See solution above
% 0.20/0.53 ||#
% 0.20/0.53
% 0.20/0.53 ; Summary of computation:
% 0.20/0.53 ; 64 formulas have been input or derived (from 29 formulas).
% 0.20/0.53 ; 39 (61%) were retained. Of these,
% 0.20/0.53 ; 39 (100%) are still being kept.
% 0.20/0.53 ;
% 0.20/0.53 ; Run time in seconds excluding printing time:
% 0.20/0.53 ; 0.002 4% Read assertion file (1 call)
% 0.20/0.53 ; 0.001 2% Assert (5 calls)
% 0.20/0.53 ; 0.008 17% Process new row (57 calls)
% 0.20/0.53 ; 0.002 4% Resolution (56 calls)
% 0.20/0.53 ; 0.001 2% Paramodulation (28 calls)
% 0.20/0.53 ; 0.000 0% Factoring (15 calls)
% 0.20/0.53 ; 0.004 8% Condensing (39 calls)
% 0.20/0.53 ; 0.001 2% Forward subsumption (39 calls)
% 0.20/0.53 ; 0.002 4% Backward subsumption (31 calls)
% 0.20/0.53 ; 0.000 0% Clause clause subsumption (14 calls)
% 0.20/0.53 ; 0.003 6% Forward simplification (57 calls)
% 0.20/0.53 ; 0.000 0% Backward simplification (39 calls)
% 0.20/0.53 ; 0.000 0% Sortal reasoning (360 calls)
% 0.20/0.53 ; 0.000 0% Purity testing (1 call)
% 0.20/0.53 ; 0.024 50% Other
% 0.20/0.53 ; 0.048 Total
% 0.20/0.53 ; 0.052 Real time
% 0.20/0.53 ;
% 0.20/0.53 ; Term-hash-array has 155 terms in all.
% 0.20/0.53 ; Feature-vector-row-index has 31 entries (31 at peak, 31 added, 0 deleted).
% 0.20/0.53 ; Feature-vector-row-index has 293 nodes (293 at peak, 293 added, 0 deleted).
% 0.20/0.53 ; Retrieved 14 possibly forward subsuming rows in 39 calls.
% 0.20/0.53 ; Retrieved 0 possibly backward subsumed rows in 31 calls.
% 0.20/0.53 ; Path-index has 167 entries (167 at peak, 167 added, 0 deleted).
% 0.20/0.53 ; Path-index has 211 nodes (211 at peak, 211 added, 0 deleted).
% 0.20/0.53 ; Trie-index has 167 entries (167 at peak, 167 added, 0 deleted).
% 0.20/0.53 ; Trie-index has 254 nodes (254 at peak, 254 added, 0 deleted).
% 0.20/0.53 ; Retrieved 15 generalization terms in 49 calls.
% 0.20/0.53 ; Retrieved 7 instance terms in 7 calls.
% 0.20/0.53 ; Retrieved 109 unifiable terms in 158 calls.
% 0.20/0.53 ;
% 0.20/0.53 ; The agenda of rows to process has 5 entries:
% 0.20/0.53 ; 1 with value 59 1 with value 65 1 with value 79
% 0.20/0.53 ; 1 with value 63 1 with value 74
% 0.20/0.53 ; The agenda of rows to give has 10 entries:
% 0.20/0.53 ; 1 with value (4 60) 1 with value (4 63) 1 with value (4 73)
% 0.20/0.53 ; 1 with value (4 61) 1 with value (4 68) 1 with value (4 75)
% 0.20/0.53 ; 1 with value (4 62) 2 with value (4 70) 1 with value (4 76)
% 0.20/0.53 Evaluation took:
% 0.20/0.53 0.053 seconds of real time
% 0.20/0.53 0.050336 seconds of user run time
% 0.20/0.53 0.002103 seconds of system run time
% 0.20/0.53 0 calls to %EVAL
% 0.20/0.53 0 page faults and
% 0.20/0.53 3,549,912 bytes consed.
% 0.20/0.53 :PROOF-FOUND
% 0.20/0.53 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T17:10:44
% 0.20/0.53 :PROOF-FOUND
% 0.20/0.53 *
%------------------------------------------------------------------------------