TSTP Solution File: DAT021_1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : DAT021_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n011.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:13 EDT 2022
% Result : Theorem 0.85s 1.04s
% Output : Refutation 0.85s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 'CODE-FOR-$$$LESS')
% Comments :
%------------------------------------------------------------------------------
tff(1,axiom,
! [X: $int] : ~ in(X,empty),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/DAT002=0.ax',ax4) ).
tff('SOLVE-$$LESS-BY-$$$LESS',axiom,
! [X: 'NUMBER',Y: 'NUMBER'] :
( $less(X,Y)
| ~ '$$$LESS'(X,Y) ) ).
tff(22,negated_conjecture,
'SKOLEMAAAV1.collection' = add(5,add(3,add(1,empty))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(23,negated_conjecture,
in('SKOLEMAAAV2.$int','SKOLEMAAAV1.collection'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(24,negated_conjecture,
in('SKOLEMAAAV3.$int','SKOLEMAAAV1.collection'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(25,negated_conjecture,
'SKOLEMAAAV2.$int' != 'SKOLEMAAAV3.$int',
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(26,negated_conjecture,
~ $less($sum('SKOLEMAAAV2.$int','SKOLEMAAAV3.$int'),9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(27,plain,
~ '$$$LESS'($sum('SKOLEMAAAV2.$int','SKOLEMAAAV3.$int'),9),
inference('HYPERRESOLVE',[status(thm)],[26,'SOLVE-$$LESS-BY-$$$LESS']) ).
tff(38,plain,
! [X: $int] :
( in(X,add(3,add(1,empty)))
| ( X = 5 )
| ~ in(X,'SKOLEMAAAV1.collection') ),
inference('PARAMODULATE',[status(thm)],[6,22,theory(equality)]) ).
tff(293,plain,
( in('SKOLEMAAAV2.$int',add(3,add(1,empty)))
| ( 'SKOLEMAAAV2.$int' = 5 ) ),
inference('HYPERRESOLVE',[status(thm)],[38,23]) ).
tff(294,plain,
( in('SKOLEMAAAV3.$int',add(3,add(1,empty)))
| ( 'SKOLEMAAAV3.$int' = 5 ) ),
inference('HYPERRESOLVE',[status(thm)],[38,24]) ).
tff(295,plain,
( ( 'SKOLEMAAAV2.$int' = 5 )
| in('SKOLEMAAAV2.$int',add(1,empty))
| ( 'SKOLEMAAAV2.$int' = 3 ) ),
inference('HYPERRESOLVE',[status(thm)],[6,293]) ).
tff(298,plain,
( ( 'SKOLEMAAAV3.$int' = 5 )
| in('SKOLEMAAAV3.$int',add(1,empty))
| ( 'SKOLEMAAAV3.$int' = 3 ) ),
inference('HYPERRESOLVE',[status(thm)],[6,294]) ).
tff(301,plain,
( ( 'SKOLEMAAAV2.$int' = 5 )
| ( 'SKOLEMAAAV2.$int' = 3 )
| ( 'SKOLEMAAAV2.$int' = 1 ) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[6,295]),1]) ).
tff(304,plain,
( ( 'SKOLEMAAAV2.$int' = 3 )
| ( 'SKOLEMAAAV2.$int' = 1 )
| ( 'SKOLEMAAAV3.$int' != 5 ) ),
inference('PARAMODULATE',[status(thm)],[25,301,theory(equality)]) ).
tff(311,plain,
( ( 'SKOLEMAAAV2.$int' = 3 )
| ( 'SKOLEMAAAV2.$int' = 1 )
| ~ '$$$LESS'('SKOLEMAAAV3.$int',4) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[27,301,theory(equality)]),'CODE-FOR-$$$LESS','CODE-FOR-$$SUM']) ).
tff(373,plain,
( ( 'SKOLEMAAAV3.$int' = 5 )
| ( 'SKOLEMAAAV3.$int' = 3 )
| ( 'SKOLEMAAAV3.$int' = 1 ) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[6,298]),1]) ).
tff(383,plain,
( ( 'SKOLEMAAAV3.$int' = 3 )
| ( 'SKOLEMAAAV3.$int' = 1 )
| ~ '$$$LESS'('SKOLEMAAAV2.$int',4) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[27,373,theory(equality)]),'CODE-FOR-$$$LESS','CODE-FOR-$$SUM']) ).
tff(385,plain,
( ( 'SKOLEMAAAV3.$int' = 3 )
| ( 'SKOLEMAAAV3.$int' = 1 )
| ( 'SKOLEMAAAV2.$int' = 3 )
| ( 'SKOLEMAAAV2.$int' = 1 ) ),
inference('HYPERRESOLVE',[status(thm)],[304,373]) ).
tff(1200,plain,
( ( 'SKOLEMAAAV3.$int' = 1 )
| ( 'SKOLEMAAAV2.$int' = 3 )
| ( 'SKOLEMAAAV2.$int' = 1 ) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[311,385,theory(equality)]),'CODE-FOR-$$$LESS']) ).
tff(1201,plain,
( ( 'SKOLEMAAAV2.$int' = 3 )
| ( 'SKOLEMAAAV2.$int' = 1 ) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[311,1200,theory(equality)]),'CODE-FOR-$$$LESS']) ).
tff(1202,plain,
( ( 'SKOLEMAAAV2.$int' = 1 )
| ( 'SKOLEMAAAV3.$int' != 3 ) ),
inference('PARAMODULATE',[status(thm)],[25,1201,theory(equality)]) ).
tff(1209,plain,
( ( 'SKOLEMAAAV2.$int' = 1 )
| ~ '$$$LESS'('SKOLEMAAAV3.$int',6) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[27,1201,theory(equality)]),'CODE-FOR-$$$LESS','CODE-FOR-$$SUM']) ).
tff(1227,plain,
( ( 'SKOLEMAAAV2.$int' = 1 )
| ( 'SKOLEMAAAV3.$int' = 3 )
| ( 'SKOLEMAAAV3.$int' = 1 ) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[383,1201,theory(equality)]),'CODE-FOR-$$$LESS']) ).
tff(1377,plain,
( ( 'SKOLEMAAAV2.$int' = 1 )
| ( 'SKOLEMAAAV3.$int' = 1 ) ),
inference('HYPERRESOLVE',[status(thm)],[1202,1227]) ).
tff(1378,plain,
'SKOLEMAAAV2.$int' = 1,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1209,1377,theory(equality)]),'CODE-FOR-$$$LESS']) ).
tff(1379,plain,
'SKOLEMAAAV3.$int' != 1,
inference('REWRITE',[status(thm)],[25,1378,theory(equality)]) ).
tff(1387,plain,
~ $less($sum(1,'SKOLEMAAAV3.$int'),9),
inference('REWRITE',[status(thm)],[26,1378,theory(equality)]) ).
tff(1575,plain,
'SKOLEMAAAV3.$int' = 3,
inference('REWRITE',[status(thm)],[383,'CODE-FOR-$$$LESS',1379,1378,theory(equality)]) ).
cnf(1578,plain,
$false,
inference('REWRITE',[status(thm)],[1387,'CODE-FOR-$$LESS','CODE-FOR-$$SUM',1575,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : DAT021_1 : TPTP v8.1.0. Released v5.0.0.
% 0.12/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n011.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:02:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 2022-07-01T17:02:04
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n011.cluster.edu at 2022-07-01T17:02:04
% 0.85/1.04
% 0.85/1.04
% 0.85/1.04 #||
% 0.85/1.04 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/1.04 % SZS output start Refutation
% See solution above
% 0.85/1.04 ||#
% 0.85/1.04
% 0.85/1.04 ; Summary of computation:
% 0.85/1.04 ; 4588 formulas have been input or derived (from 308 formulas).
% 0.85/1.04 ; 1578 (34%) were retained. Of these,
% 0.85/1.04 ; 1454 (92%) were simplified or subsumed later,
% 0.85/1.04 ; 124 ( 8%) are still being kept.
% 0.85/1.04 ;
% 0.85/1.04 ; Run time in seconds excluding printing time:
% 0.85/1.04 ; 0.003 1% Read assertion file (1 call)
% 0.85/1.04 ; 0.001 0% Assert (6 calls)
% 0.85/1.04 ; 0.136 24% Process new row (3,224 calls)
% 0.85/1.04 ; 0.066 12% Resolution (614 calls)
% 0.85/1.04 ; 0.034 6% Paramodulation (307 calls)
% 0.85/1.04 ; 0.002 0% Factoring (91 calls)
% 0.85/1.04 ; 0.015 3% Condensing (1,265 calls)
% 0.85/1.04 ; 0.102 18% Forward subsumption (1,265 calls)
% 0.85/1.04 ; 0.045 8% Backward subsumption (1,039 calls)
% 0.85/1.04 ; 0.007 1% Clause clause subsumption (1,675 calls)
% 0.85/1.04 ; 0.051 9% Forward simplification (2,631 calls)
% 0.85/1.04 ; 0.046 8% Backward simplification (1,578 calls)
% 0.85/1.04 ; 0.013 2% Ordering (14,764 calls)
% 0.85/1.04 ; 0.006 1% Sortal reasoning (7,953 calls)
% 0.85/1.04 ; 0.000 0% Purity testing (1 call)
% 0.85/1.04 ; 0.037 7% Other
% 0.85/1.04 ; 0.564 Total
% 0.85/1.04 ; 0.566 Real time
% 0.85/1.04 ;
% 0.85/1.04 ; Term-hash-array has 2,869 terms in all.
% 0.85/1.04 ; Feature-vector-row-index has 83 entries (798 at peak, 1,039 added, 956 deleted).
% 0.85/1.04 ; Feature-vector-row-index has 301 nodes (6,804 at peak, 8,744 added, 8,443 deleted).
% 0.85/1.04 ; Retrieved 1,809 possibly forward subsuming rows in 1,265 calls.
% 0.85/1.04 ; Retrieved 694 possibly backward subsumed rows in 1,039 calls.
% 0.85/1.04 ; Path-index has 254 entries (2,453 at peak, 3,171 added, 2,917 deleted).
% 0.85/1.04 ; Path-index has 612 nodes (1,341 at peak, 1,567 added, 955 deleted).
% 0.85/1.04 ; Trie-index has 254 entries (2,453 at peak, 3,171 added, 2,917 deleted).
% 0.85/1.04 ; Trie-index has 451 nodes (5,210 at peak, 6,616 added, 6,165 deleted).
% 0.85/1.04 ; Retrieved 3,339 generalization terms in 7,985 calls.
% 0.85/1.04 ; Retrieved 538 instance terms in 538 calls.
% 0.85/1.04 ; Retrieved 10,780 unifiable terms in 3,590 calls.
% 0.85/1.04 ;
% 0.85/1.04 ; The agenda of backward simplifiable rows to process has 887 entries:
% 0.85/1.04 ; 887 with value 0
% 0.85/1.04 ; The agenda of rows to process has 195 entries:
% 0.85/1.04 ; 2 with value 19 1 with value 26 5 with value 30
% 0.85/1.04 ; 14 with value 22 2 with value 27 89 with value 31
% 0.85/1.04 ; 1 with value 23 41 with value 28 15 with value 32
% 0.85/1.04 ; 17 with value 25 6 with value 29 2 with value 33
% 0.85/1.04 ; The agenda of rows to give has 53 entries:
% 0.85/1.04 ; 1 with value (4 9) 2 with value (4 24) 1 with value (4 28)
% 0.85/1.04 ; 1 with value (4 15) 10 with value (4 25) 6 with value (4 29)
% 0.85/1.04 ; 1 with value (4 22) 9 with value (4 26) 5 with value (4 30)
% 0.85/1.04 ; 11 with value (4 23) 6 with value (4 27)
% 0.85/1.04 Evaluation took:
% 0.85/1.04 0.567 seconds of real time
% 0.85/1.04 0.502536 seconds of user run time
% 0.85/1.04 0.064037 seconds of system run time
% 0.85/1.04 [Run times include 0.026 seconds GC run time.]
% 0.85/1.04 0 calls to %EVAL
% 0.85/1.04 0 page faults and
% 0.85/1.04 43,606,032 bytes consed.
% 0.85/1.04 :PROOF-FOUND
% 0.85/1.04 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-01T17:02:05
% 0.85/1.04 :PROOF-FOUND
% 0.85/1.04 *
%------------------------------------------------------------------------------