TSTP Solution File: DAT097_1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : DAT097_1 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n028.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:37 EDT 2022
% Result : Theorem 0.42s 0.59s
% Output : Refutation 0.42s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 'CODE-FOR-$$SUM')
% Comments :
%------------------------------------------------------------------------------
tff(4,axiom,
! [X: $int,Y: list] : ( cons(X,Y) != nil ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l4) ).
tff(5,axiom,
! [X: $int,Y: list] :
( ~ in(X,Y)
| ( Y = cons('SKOLEMAAAU1.$int'(Y,X),'SKOLEMAAAU2.list'(Y,X)) )
| ( Y = cons('SKOLEMAAAU3.$int'(Y,X),'SKOLEMAAAU4.list'(Y,X)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_conv) ).
tff(9,axiom,
! [X: $int,Y: list,Z: $int,U: list] :
( in(X,Y)
| ( Y != cons(Z,U) )
| ( X != Z ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',in_conv) ).
tff(31,axiom,
! [X: $int] : ( count(X,nil) = 0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a) ).
tff(33,axiom,
! [X: $int,Y: $int,Z: list] :
( ( count(X,cons(Y,Z)) = $sum(count(X,Z),1) )
| ( X != Y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_4) ).
tff(34,plain,
! [X: $int,Y: $int,Z: list] :
( ( count(X,cons(Y,Z)) = $sum(1,count(X,Z)) )
| ( X != Y ) ),
inference('REWRITE',[status(thm)],[33,'CODE-FOR-$$SUM']) ).
tff(35,axiom,
! [X: list] : ( append(nil,X) = X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l_6) ).
tff(36,axiom,
! [X: $int,Y: list,Z: list] : ( append(cons(X,Y),Z) = cons(X,append(Y,Z)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l_7) ).
tff(39,negated_conjecture,
! [X: $int,Y: list,Z: $int,U: list,V: list] :
( ~ in(X,Y)
| in(Z,U)
| ( V != append(Y,cons(Z,U)) )
| ( count(X,V) = count(X,Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).
tff(43,plain,
! [X: $int,Y: list,Z: list] : ( append(cons(X,Y),Z) != nil ),
inference('PARAMODULATE',[status(thm)],[4,36,theory(equality)]) ).
tff(45,plain,
! [X: $int,Y: list] : ( append(cons(X,nil),Y) = cons(X,Y) ),
inference('PARAMODULATE',[status(thm)],[36,35,theory(equality)]) ).
tff(48,plain,
! [X: $int,Y: list] :
( ~ in(X,Y)
| ( Y = append(cons('SKOLEMAAAU1.$int'(Y,X),nil),'SKOLEMAAAU2.list'(Y,X)) )
| ( Y = append(cons('SKOLEMAAAU3.$int'(Y,X),nil),'SKOLEMAAAU4.list'(Y,X)) ) ),
inference('REWRITE',[status(thm)],[5,45,theory(equality)]) ).
tff(52,plain,
! [X: $int,Y: list] : in(X,cons(X,Y)),
inference('HYPERRESOLVE',[status(thm)],[9,theory(equality),theory(equality)]) ).
tff(65,plain,
! [X: $int,Y: list] : ( count(X,cons(X,Y)) = $sum(1,count(X,Y)) ),
inference('HYPERRESOLVE',[status(thm)],[34,theory(equality)]) ).
tff(86,plain,
! [X: $int] : ~ in(X,nil),
inference('UR-RESOLVE',[status(thm)],[48,43,43]) ).
tff(138,plain,
! [X: $int,Y: list,Z: $int] :
( in(X,Y)
| ( count(Z,append(cons(Z,nil),cons(X,Y))) = 1 ) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[39,45,52]),'CODE-FOR-$$SUM',31,65,45,theory(equality)]) ).
tff(159,plain,
! [X: $int,Y: list] : ( count(X,append(cons(X,nil),Y)) = $sum(1,count(X,Y)) ),
inference('PARAMODULATE',[status(thm)],[65,45,theory(equality)]) ).
tff(160,plain,
! [X: $int,Y: list,Z: $int] :
( in(X,Y)
| ( count(Z,cons(X,Y)) = 0 ) ),
inference('REWRITE',[status(thm)],[138,'CODE-FOR-$$SUM',159,theory(equality)]) ).
tff(192,plain,
! [X: $int,Y: $int] : ( count(X,cons(Y,nil)) = 0 ),
inference('HYPERRESOLVE',[status(thm)],[86,160]) ).
cnf(204,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[65,192,theory(equality)]),31,'CODE-FOR-$$SUM',theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : DAT097_1 : TPTP v8.1.0. Released v6.1.0.
% 0.00/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 1 20:40:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 *
% 0.18/0.45 *
% 0.18/0.45 #<PACKAGE "SNARK-USER">
% 0.18/0.45 *
% 0.18/0.45 SNARK-TPTP-OPTIONS
% 0.18/0.45 *
% 0.18/0.45 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.45 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.45 (USE-FACTORING :POS)
% 0.18/0.45 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.45 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.45 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.45 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.45 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.45 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.45 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.45 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.45 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.45 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.45 *
% 0.18/0.45 "."
% 0.18/0.45 *
% 0.18/0.45 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T20:40:46
% 0.18/0.45 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n028.cluster.edu at 2022-07-01T20:40:46
% 0.42/0.59
% 0.42/0.59
% 0.42/0.59 #||
% 0.42/0.59 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.59 % SZS output start Refutation
% See solution above
% 0.42/0.60 ||#
% 0.42/0.60
% 0.42/0.60 ; Summary of computation:
% 0.42/0.60 ; 754 formulas have been input or derived (from 72 formulas).
% 0.42/0.60 ; 204 (27%) were retained. Of these,
% 0.42/0.60 ; 34 (17%) were simplified or subsumed later,
% 0.42/0.60 ; 170 (83%) are still being kept.
% 0.42/0.60 ;
% 0.42/0.60 ; Run time in seconds excluding printing time:
% 0.42/0.60 ; 0.005 4% Read assertion file (1 call)
% 0.42/0.60 ; 0.002 1% Assert (15 calls)
% 0.42/0.60 ; 0.024 17% Process new row (668 calls)
% 0.42/0.60 ; 0.013 9% Resolution (142 calls)
% 0.42/0.60 ; 0.005 4% Paramodulation (71 calls)
% 0.42/0.60 ; 0.000 0% Factoring (14 calls)
% 0.42/0.60 ; 0.006 4% Condensing (210 calls)
% 0.42/0.60 ; 0.003 2% Forward subsumption (210 calls)
% 0.42/0.60 ; 0.000 0% Backward subsumption (138 calls)
% 0.42/0.60 ; 0.002 1% Clause clause subsumption (228 calls)
% 0.42/0.60 ; 0.025 18% Forward simplification (575 calls)
% 0.42/0.60 ; 0.006 4% Backward simplification (203 calls)
% 0.42/0.60 ; 0.017 12% Ordering (2,468 calls)
% 0.42/0.60 ; 0.000 0% Ordering ac (1 call)
% 0.42/0.60 ; 0.002 1% Sortal reasoning (1,929 calls)
% 0.42/0.60 ; 0.000 0% Purity testing (1 call)
% 0.42/0.60 ; 0.029 21% Other
% 0.42/0.60 ; 0.139 Total
% 0.42/0.60 ; 0.141 Real time
% 0.42/0.60 ;
% 0.42/0.60 ; Term-hash-array has 549 terms in all.
% 0.42/0.60 ; Feature-vector-row-index has 118 entries (118 at peak, 138 added, 20 deleted).
% 0.42/0.60 ; Feature-vector-row-index has 889 nodes (889 at peak, 1,080 added, 191 deleted).
% 0.42/0.60 ; Retrieved 271 possibly forward subsuming rows in 210 calls.
% 0.42/0.60 ; Retrieved 21 possibly backward subsumed rows in 138 calls.
% 0.42/0.60 ; Path-index has 460 entries (460 at peak, 584 added, 124 deleted).
% 0.42/0.60 ; Path-index has 1,617 nodes (1,617 at peak, 1,779 added, 162 deleted).
% 0.42/0.60 ; Trie-index has 460 entries (460 at peak, 584 added, 124 deleted).
% 0.42/0.60 ; Trie-index has 1,573 nodes (1,573 at peak, 2,020 added, 447 deleted).
% 0.42/0.60 ; Retrieved 2,861 generalization terms in 3,432 calls.
% 0.42/0.60 ; Retrieved 146 instance terms in 76 calls.
% 0.42/0.60 ; Retrieved 4,698 unifiable terms in 678 calls.
% 0.42/0.60 ;
% 0.42/0.60 ; The agenda of rows to process has 24 entries:
% 0.42/0.60 ; 4 with value 15 6 with value 20 1 with value 28
% 0.42/0.60 ; 1 with value 16 1 with value 22 1 with value 33
% 0.42/0.60 ; 3 with value 17 1 with value 24 1 with value 45
% 0.42/0.60 ; 5 with value 18
% 0.42/0.60 ; The agenda of rows to give has 104 entries:
% 0.42/0.60 ; 3 with value (4 16) 3 with value (4 29) 2 with value (4 43)
% 0.42/0.60 ; 11 with value (4 17) 1 with value (4 30) 3 with value (4 44)
% 0.42/0.60 ; 3 with value (4 18) 5 with value (4 31) 2 with value (4 45)
% 0.42/0.60 ; 6 with value (4 19) 3 with value (4 32) 1 with value (4 46)
% 0.42/0.60 ; 8 with value (4 20) 3 with value (4 33) 1 with value (4 48)
% 0.42/0.60 ; 3 with value (4 21) 2 with value (4 34) 2 with value (4 51)
% 0.42/0.60 ; 4 with value (4 22) 5 with value (4 35) 2 with value (4 53)
% 0.42/0.60 ; 5 with value (4 23) 2 with value (4 36) 1 with value (4 54)
% 0.42/0.60 ; 1 with value (4 25) 1 with value (4 37) 1 with value (4 55)
% 0.42/0.60 ; 3 with value (4 26) 1 with value (4 38) 1 with value (4 56)
% 0.42/0.60 ; 5 with value (4 27) 2 with value (4 39) 1 with value (4 61)
% 0.42/0.60 ; 3 with value (4 28) 3 with value (4 42) 1 with value (4 73)
% 0.42/0.60 Evaluation took:
% 0.42/0.60 0.141 seconds of real time
% 0.42/0.60 0.12528 seconds of user run time
% 0.42/0.60 0.016345 seconds of system run time
% 0.42/0.60 0 calls to %EVAL
% 0.42/0.60 0 page faults and
% 0.42/0.60 8,689,064 bytes consed.
% 0.42/0.60 :PROOF-FOUND
% 0.42/0.60 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T20:40:46
% 0.42/0.60 :PROOF-FOUND
% 0.42/0.60 *
%------------------------------------------------------------------------------