%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : DAT102_1 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n020.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:38 EDT 2022
% Result : Theorem 0.19s 0.58s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 22 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 99 ( 13 equ)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 17 ( 8 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 68 ( 68 fml; 0 var)
% Number arithmetic : 36 ( 3 atm; 0 fun; 0 num; 33 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 11 ( 8 usr; 3 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 43 ( 0 sgn 42 !; 0 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
tff(1,axiom,
! [X: $int,Y: list] : ( head(cons(X,Y)) = X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1) ).
tff(2,axiom,
! [X: $int,Y: list] : ( tail(cons(X,Y)) = Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2) ).
tff(4,axiom,
! [X: $int,Y: list] : ( cons(X,Y) != nil ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l4) ).
cnf('$$LESS-IS-IRREFLEXIVE',axiom,
~ $less(X,X) ).
tff(17,axiom,
! [X: $int,Y: list] :
( ~ inRange(X,Y)
| ( Y = nil )
| ( Y = cons('SKOLEMAAAV1.$int'(Y,X),'SKOLEMAAAV2.list'(Y,X)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inRange) ).
tff(19,axiom,
! [X: $int,Y: list] :
( ~ inRange(X,Y)
| ( Y = nil )
| $less('SKOLEMAAAV1.$int'(Y,X),X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inRange) ).
tff(20,axiom,
! [X: $int,Y: list] :
( ~ inRange(X,Y)
| ( Y = nil )
| inRange(X,'SKOLEMAAAV2.list'(Y,X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inRange) ).
tff(21,axiom,
! [X: $int,Y: list] :
( inRange(X,Y)
| ( Y != nil ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inRange) ).
tff(23,negated_conjecture,
! [X: $int,Y: list] :
( ~ inRange(X,tail(Y))
| inRange(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).
tff(24,plain,
! [X: $int] : inRange(X,nil),
inference('HYPERRESOLVE',[status(thm)],[21,theory(equality)]) ).
tff(25,plain,
! [X: $int,Y: list,Z: $int] :
( ~ inRange(X,Y)
| inRange(X,cons(Z,Y)) ),
inference('PARAMODULATE',[status(thm)],[23,2,theory(equality)]) ).
tff(29,plain,
! [X: $int,Y: $int] : inRange(X,cons(Y,nil)),
inference('HYPERRESOLVE',[status(thm)],[25,24]) ).
tff(31,plain,
! [X: $int,Y: $int] : inRange(X,'SKOLEMAAAV2.list'(cons(Y,nil),X)),
inference('UR-RESOLVE',[status(thm)],[20,29,4]) ).
tff(32,plain,
! [X: $int,Y: $int] : $less('SKOLEMAAAV1.$int'(cons(X,nil),Y),Y),
inference('UR-RESOLVE',[status(thm)],[19,29,4]) ).
tff(34,plain,
! [X: $int,Y: $int] : ( cons(X,nil) = cons('SKOLEMAAAV1.$int'(cons(X,nil),Y),'SKOLEMAAAV2.list'(cons(X,nil),Y)) ),
inference('UR-RESOLVE',[status(thm)],[17,29,4]) ).
tff(40,plain,
! [X: $int,Y: $int,Z: $int] : inRange(X,cons(Y,'SKOLEMAAAV2.list'(cons(Z,nil),X))),
inference('HYPERRESOLVE',[status(thm)],[25,31]) ).
tff(63,plain,
! [X: $int,Y: $int,Z: $int] : ( cons(X,'SKOLEMAAAV2.list'(cons(Y,nil),Z)) = cons('SKOLEMAAAV1.$int'(cons(X,'SKOLEMAAAV2.list'(cons(Y,nil),Z)),Z),'SKOLEMAAAV2.list'(cons(X,'SKOLEMAAAV2.list'(cons(Y,nil),Z)),Z)) ),
inference('UR-RESOLVE',[status(thm)],[17,40,4]) ).
tff(93,plain,
! [X: $int,Y: $int] : ( 'SKOLEMAAAV2.list'(cons(X,nil),Y) = nil ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2,34,theory(equality)]),2,theory(equality)]) ).
tff(94,plain,
! [X: $int,Y: $int] : ( cons(X,nil) = cons('SKOLEMAAAV1.$int'(cons(X,nil),Y),nil) ),
inference('REWRITE',[status(thm)],[63,93,theory(equality)]) ).
tff(95,plain,
! [X: $int,Y: $int] : ( X = 'SKOLEMAAAV1.$int'(cons(X,nil),Y) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,94,theory(equality)]),1,theory(equality)]) ).
tff(97,plain,
! [X: $int,Y: $int] : $less(X,Y),
inference('REWRITE',[status(thm)],[32,95,theory(equality)]) ).
cnf(104,plain,
$false,
inference('HYPERRESOLVE',[status(thm)],['$$LESS-IS-IRREFLEXIVE',97]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : DAT102_1 : TPTP v8.1.0. Released v6.1.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n020.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 Jul 1 17:38:30 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.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/sandbox/benchmark/theBenchmark.p 2022-07-01T17:38:30
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-07-01T17:38:30
% 0.19/0.58
% 0.19/0.58
% 0.19/0.58 #||
% 0.19/0.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.58 % SZS output start Refutation
% See solution above
% 0.19/0.58 ||#
% 0.19/0.58
% 0.19/0.58 ; Summary of computation:
% 0.19/0.58 ; 925 formulas have been input or derived (from 53 formulas).
% 0.19/0.58 ; 104 (11%) were retained. Of these,
% 0.19/0.58 ; 53 (51%) were simplified or subsumed later,
% 0.19/0.58 ; 51 (49%) are still being kept.
% 0.19/0.58 ;
% 0.19/0.58 ; Run time in seconds excluding printing time:
% 0.19/0.58 ; 0.002 2% Read assertion file (1 call)
% 0.19/0.58 ; 0.000 0% Assert (6 calls)
% 0.19/0.58 ; 0.015 14% Process new row (855 calls)
% 0.19/0.58 ; 0.025 24% Resolution (104 calls)
% 0.19/0.58 ; 0.002 2% Paramodulation (52 calls)
% 0.19/0.58 ; 0.000 0% Factoring (5 calls)
% 0.19/0.58 ; 0.001 1% Condensing (45 calls)
% 0.19/0.58 ; 0.001 1% Forward subsumption (45 calls)
% 0.19/0.58 ; 0.000 0% Backward subsumption (40 calls)
% 0.19/0.58 ; 0.001 1% Clause clause subsumption (28 calls)
% 0.19/0.58 ; 0.025 24% Forward simplification (812 calls)
% 0.19/0.58 ; 0.004 4% Backward simplification (104 calls)
% 0.19/0.58 ; 0.000 0% Ordering (147 calls)
% 0.19/0.58 ; 0.005 5% Sortal reasoning (1,076 calls)
% 0.19/0.59 ; 0.000 0% Purity testing (1 call)
% 0.19/0.59 ; 0.025 24% Other
% 0.19/0.59 ; 0.106 Total
% 0.19/0.59 ; 0.109 Real time
% 0.19/0.59 ;
% 0.19/0.59 ; Term-hash-array has 223 terms in all.
% 0.19/0.59 ; Feature-vector-row-index has 20 entries (34 at peak, 40 added, 20 deleted).
% 0.19/0.59 ; Feature-vector-row-index has 82 nodes (201 at peak, 235 added, 153 deleted).
% 0.19/0.59 ; Retrieved 29 possibly forward subsuming rows in 45 calls.
% 0.19/0.59 ; Retrieved 0 possibly backward subsumed rows in 40 calls.
% 0.19/0.59 ; Path-index has 122 entries (212 at peak, 248 added, 126 deleted).
% 0.19/0.59 ; Path-index has 903 nodes (1,072 at peak, 1,097 added, 194 deleted).
% 0.19/0.59 ; Trie-index has 122 entries (212 at peak, 248 added, 126 deleted).
% 0.19/0.59 ; Trie-index has 519 nodes (932 at peak, 971 added, 452 deleted).
% 0.19/0.59 ; Retrieved 1,646 generalization terms in 5,917 calls.
% 0.19/0.59 ; Retrieved 96 instance terms in 63 calls.
% 0.19/0.59 ; Retrieved 3,717 unifiable terms in 885 calls.
% 0.19/0.59 ;
% 0.19/0.59 ; The agenda of rows to process has 1 entry:
% 0.19/0.59 ; 1 with value 8
% 0.19/0.59 ; The agenda of rows to give has 18 entries:
% 0.19/0.59 ; 1 with value (4 7) 5 with value (4 25) 1 with value (4 41)
% 0.19/0.59 ; 1 with value (4 8) 1 with value (4 30) 2 with value (4 46)
% 0.19/0.59 ; 1 with value (4 14) 1 with value (4 34) 1 with value (4 51)
% 0.19/0.59 ; 1 with value (4 16) 1 with value (4 38) 1 with value (4 62)
% 0.19/0.59 ; 1 with value (4 19)
% 0.19/0.59 Evaluation took:
% 0.19/0.59 0.109 seconds of real time
% 0.19/0.59 0.092168 seconds of user run time
% 0.19/0.59 0.01715 seconds of system run time
% 0.19/0.59 0 calls to %EVAL
% 0.19/0.59 0 page faults and
% 0.19/0.59 7,116,424 bytes consed.
% 0.19/0.59 :PROOF-FOUND
% 0.19/0.59 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T17:38:30
% 0.19/0.59 :PROOF-FOUND
% 0.19/0.59 *
%------------------------------------------------------------------------------