TSTP Solution File: DAT039_1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : DAT039_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n009.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:19 EDT 2022
% Result : Theorem 0.93s 1.11s
% Output : Refutation 0.93s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 'CODE-FOR-$$GREATER')
% Comments :
%------------------------------------------------------------------------------
tff(1,axiom,
! [X: $int] : ~ in(X,empty),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002=0.ax',ax1) ).
tff(6,axiom,
! [X: $int,Y: collection,Z: $int] :
( in(X,Y)
| ( X = Z )
| ~ in(X,add(Z,Y)) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002=0.ax',ax4) ).
tff(7,axiom,
! [X: $int,Y: collection,Z: $int] :
( ~ in(X,Y)
| ( X = Z )
| in(X,remove(Z,Y)) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002=0.ax',ax5) ).
tff('SOLVE-~$$GREATER-BY-$$$LESS',axiom,
! [X: 'NUMBER',Y: 'NUMBER'] :
( ~ $greater(X,Y)
| '$$$LESS'(Y,X) ) ).
tff(24,axiom,
! [X: collection] :
( ( X = empty )
| ( count(X) != 0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002=1.ax',ax2) ).
tff(29,axiom,
! [X: $int,Y: collection] :
( ~ in(X,Y)
| ( count(add(X,Y)) = count(Y) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002=1.ax',ax4) ).
tff(30,axiom,
! [X: $int,Y: collection] :
( in(X,Y)
| ( count(add(X,Y)) != count(Y) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002=1.ax',ax4) ).
tff(31,axiom,
! [X: $int,Y: collection] :
( ~ in(X,Y)
| ( count(remove(X,Y)) = $difference(count(Y),1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002=1.ax',ax5) ).
tff(32,plain,
! [X: $int,Y: collection] :
( ~ in(X,Y)
| ( count(remove(X,Y)) = $sum(-1,count(Y)) ) ),
inference('REWRITE',[status(thm)],[31,'CODE-FOR-$$SUM','CODE-FOR-$$PRODUCT','CODE-FOR-$$UMINUS','CODE-FOR-$$DIFFERENCE']) ).
tff(37,axiom,
! [X: $int,Y: collection] :
( ~ in(X,Y)
| ( Y = add(X,remove(X,Y)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002=1.ax',ax7) ).
tff(38,negated_conjecture,
in(2,'SKOLEMAAAU1.collection'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(39,negated_conjecture,
in(3,'SKOLEMAAAU1.collection'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(40,negated_conjecture,
count('SKOLEMAAAU1.collection') = 2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(41,negated_conjecture,
$greater('SKOLEMAAAU2.$int',3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(42,negated_conjecture,
in('SKOLEMAAAU2.$int','SKOLEMAAAU1.collection'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(43,plain,
'$$$LESS'(3,'SKOLEMAAAU2.$int'),
inference('HYPERRESOLVE',[status(thm)],['SOLVE-~$$GREATER-BY-$$$LESS',41]) ).
tff(75,plain,
! [X: $int] :
( ( 2 = X )
| in(2,remove(X,'SKOLEMAAAU1.collection')) ),
inference('HYPERRESOLVE',[status(thm)],[7,38]) ).
tff(77,plain,
! [X: $int] :
( ( 'SKOLEMAAAU2.$int' = X )
| in('SKOLEMAAAU2.$int',remove(X,'SKOLEMAAAU1.collection')) ),
inference('HYPERRESOLVE',[status(thm)],[7,42]) ).
tff(92,plain,
count(remove(3,'SKOLEMAAAU1.collection')) = 1,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[32,39]),'CODE-FOR-$$SUM',40,theory(equality)]) ).
tff(144,plain,
! [X: $int] :
( in(X,remove(3,'SKOLEMAAAU1.collection'))
| ( count(add(X,remove(3,'SKOLEMAAAU1.collection'))) != 1 ) ),
inference('PARAMODULATE',[status(thm)],[30,92,theory(equality)]) ).
tff(164,plain,
! [X: $int] :
( ( 2 = X )
| ( count(add(2,remove(X,'SKOLEMAAAU1.collection'))) = count(remove(X,'SKOLEMAAAU1.collection')) ) ),
inference('HYPERRESOLVE',[status(thm)],[29,75]) ).
tff(1481,plain,
in(2,remove(3,'SKOLEMAAAU1.collection')),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[144,164,theory(equality)]),92,theory(equality)]) ).
tff(1499,plain,
remove(3,'SKOLEMAAAU1.collection') = add(2,remove(2,remove(3,'SKOLEMAAAU1.collection'))),
inference('HYPERRESOLVE',[status(thm)],[37,1481]) ).
tff(1501,plain,
count(remove(2,remove(3,'SKOLEMAAAU1.collection'))) = 0,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[32,1481]),'CODE-FOR-$$SUM',92,theory(equality)]) ).
tff(1512,plain,
remove(2,remove(3,'SKOLEMAAAU1.collection')) = empty,
inference('HYPERRESOLVE',[status(thm)],[24,1501]) ).
tff(1513,plain,
remove(3,'SKOLEMAAAU1.collection') = add(2,empty),
inference('REWRITE',[status(thm)],[1499,1512,theory(equality)]) ).
tff(1555,plain,
( ( 'SKOLEMAAAU2.$int' = 3 )
| in('SKOLEMAAAU2.$int',add(2,empty)) ),
inference('PARAMODULATE',[status(thm)],[77,1513,theory(equality)]) ).
tff(1570,plain,
( ( 'SKOLEMAAAU2.$int' = 3 )
| ( 'SKOLEMAAAU2.$int' = 2 ) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[6,1555]),1]) ).
tff(1574,plain,
'SKOLEMAAAU2.$int' = 2,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[43,1570,theory(equality)]),'CODE-FOR-$$$LESS']) ).
cnf(1575,plain,
$false,
inference('REWRITE',[status(thm)],[41,'CODE-FOR-$$GREATER',1574,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : DAT039_1 : TPTP v8.1.0. Released v5.0.0.
% 0.07/0.12 % Command : run-snark %s %d
% 0.13/0.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jul 1 17:06:07 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 *
% 0.19/0.45 *
% 0.19/0.45 #<PACKAGE "SNARK-USER">
% 0.19/0.45 *
% 0.19/0.45 SNARK-TPTP-OPTIONS
% 0.19/0.45 *
% 0.19/0.45 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.45 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.45 (USE-FACTORING :POS)
% 0.19/0.45 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.45 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.45 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.45 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.45 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.45 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.45 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.45 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.45 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.45 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.45 *
% 0.19/0.45 "."
% 0.19/0.45 *
% 0.19/0.45 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T17:06:07
% 0.19/0.45 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n009.cluster.edu at 2022-07-01T17:06:07
% 0.93/1.11
% 0.93/1.11
% 0.93/1.11 #||
% 0.93/1.11 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.93/1.11 % SZS output start Refutation
% See solution above
% 0.93/1.12 ||#
% 0.93/1.12
% 0.93/1.12 ; Summary of computation:
% 0.93/1.12 ; 5749 formulas have been input or derived (from 253 formulas).
% 0.93/1.12 ; 1575 (27%) were retained. Of these,
% 0.93/1.12 ; 425 (27%) were simplified or subsumed later,
% 0.93/1.12 ; 1150 (73%) are still being kept.
% 0.93/1.12 ;
% 0.93/1.12 ; Run time in seconds excluding printing time:
% 0.93/1.12 ; 0.005 1% Read assertion file (1 call)
% 0.93/1.12 ; 0.001 0% Assert (13 calls)
% 0.93/1.12 ; 0.177 27% Process new row (4,893 calls)
% 0.93/1.12 ; 0.071 11% Resolution (504 calls)
% 0.93/1.12 ; 0.039 6% Paramodulation (252 calls)
% 0.93/1.12 ; 0.001 0% Factoring (63 calls)
% 0.93/1.12 ; 0.008 1% Condensing (1,421 calls)
% 0.93/1.12 ; 0.080 12% Forward subsumption (1,421 calls)
% 0.93/1.12 ; 0.030 5% Backward subsumption (1,078 calls)
% 0.93/1.12 ; 0.007 1% Clause clause subsumption (2,482 calls)
% 0.93/1.12 ; 0.145 22% Forward simplification (4,845 calls)
% 0.93/1.12 ; 0.025 4% Backward simplification (1,571 calls)
% 0.93/1.12 ; 0.010 2% Ordering (5,126 calls)
% 0.93/1.12 ; 0.000 0% Ordering ac (6 calls)
% 0.93/1.12 ; 0.013 2% Sortal reasoning (16,824 calls)
% 0.93/1.12 ; 0.000 0% Purity testing (1 call)
% 0.93/1.12 ; 0.041 6% Other
% 0.93/1.12 ; 0.653 Total
% 0.93/1.12 ; 0.666 Real time
% 0.93/1.12 ;
% 0.93/1.12 ; Term-hash-array has 3,844 terms in all.
% 0.93/1.12 ; Feature-vector-row-index has 768 entries (1,026 at peak, 1,078 added, 310 deleted).
% 0.93/1.12 ; Feature-vector-row-index has 7,196 nodes (9,806 at peak, 10,453 added, 3,257 deleted).
% 0.93/1.12 ; Retrieved 3,564 possibly forward subsuming rows in 1,421 calls.
% 0.93/1.12 ; Retrieved 277 possibly backward subsumed rows in 1,078 calls.
% 0.93/1.12 ; Path-index has 2,996 entries (3,683 at peak, 3,921 added, 925 deleted).
% 0.93/1.12 ; Path-index has 4,044 nodes (4,144 at peak, 4,249 added, 205 deleted).
% 0.93/1.12 ; Trie-index has 2,996 entries (3,683 at peak, 3,921 added, 925 deleted).
% 0.93/1.12 ; Trie-index has 8,174 nodes (10,499 at peak, 11,143 added, 2,969 deleted).
% 0.93/1.12 ; Retrieved 11,202 generalization terms in 30,348 calls.
% 0.93/1.12 ; Retrieved 499 instance terms in 492 calls.
% 0.93/1.12 ; Retrieved 29,957 unifiable terms in 3,028 calls.
% 0.93/1.12 ;
% 0.93/1.12 ; The agenda of backward simplifiable rows to process has 267 entries:
% 0.93/1.12 ; 267 with value 0
% 0.93/1.12 ; The agenda of rows to process has 45 entries:
% 0.93/1.12 ; 2 with value 15 2 with value 22 7 with value 28
% 0.93/1.12 ; 3 with value 18 2 with value 24 1 with value 29
% 0.93/1.12 ; 3 with value 19 3 with value 25 8 with value 30
% 0.93/1.12 ; 4 with value 20 4 with value 26 2 with value 31
% 0.93/1.12 ; 2 with value 21 2 with value 27
% 0.93/1.12 ; The agenda of rows to give has 948 entries:
% 0.93/1.12 ; 1 with value (4 11) 38 with value (4 27) 40 with value (4 37)
% 0.93/1.12 ; 2 with value (4 16) 45 with value (4 28) 5 with value (4 38)
% 0.93/1.12 ; 1 with value (4 17) 35 with value (4 29) 26 with value (4 39)
% 0.93/1.12 ; 3 with value (4 18) 85 with value (4 30) 9 with value (4 40)
% 0.93/1.12 ; 15 with value (4 21) 73 with value (4 31) 21 with value (4 41)
% 0.93/1.12 ; 43 with value (4 22) 44 with value (4 32) 18 with value (4 42)
% 0.93/1.12 ; 32 with value (4 23) 79 with value (4 33) 5 with value (4 43)
% 0.93/1.12 ; 54 with value (4 24) 63 with value (4 34) 34 with value (4 44)
% 0.93/1.12 ; 48 with value (4 25) 30 with value (4 35) 8 with value (4 45)
% 0.93/1.12 ; 31 with value (4 26) 60 with value (4 36)
% 0.93/1.12 Evaluation took:
% 0.93/1.12 0.666 seconds of real time
% 0.93/1.12 0.597876 seconds of user run time
% 0.93/1.12 0.067829 seconds of system run time
% 0.93/1.12 [Run times include 0.039 seconds GC run time.]
% 0.93/1.12 0 calls to %EVAL
% 0.93/1.12 0 page faults and
% 0.93/1.12 52,212,464 bytes consed.
% 0.93/1.12 :PROOF-FOUND
% 0.93/1.12 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T17:06:08
% 0.93/1.12 :PROOF-FOUND
% 0.93/1.12 *
%------------------------------------------------------------------------------