TSTP Solution File: DAT010_1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : DAT010_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n008.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:10 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 'CODE-FOR-$$LESS')
% Comments :
%------------------------------------------------------------------------------
tff(1,axiom,
! [X: array,Y: $int,Z: $int] : ( read(write(X,Y,Z),Y) = Z ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT001=0.ax',ax1) ).
tff(2,axiom,
! [X: $int,Y: $int,Z: array,U: $int] :
( ( X = Y )
| ( read(write(Z,X,U),Y) = read(Z,Y) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT001=0.ax',ax2) ).
tff('SOLVE-$$LESS-BY-$$$LESS',axiom,
! [X: 'NUMBER',Y: 'NUMBER'] :
( $less(X,Y)
| ~ '$$$LESS'(X,Y) ) ).
tff(15,negated_conjecture,
'SKOLEMAAAV1.array' = write(write(write(write('SKOLEMAAAV2.array',3,33),4,444),5,55),4,44),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(16,negated_conjecture,
! [X: $int] : $less(read('SKOLEMAAAV2.array',X),100),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(17,negated_conjecture,
~ $less(read('SKOLEMAAAV1.array','SKOLEMAAAV3.$int'),100),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(18,plain,
~ '$$$LESS'(read('SKOLEMAAAV1.array','SKOLEMAAAV3.$int'),100),
inference('HYPERRESOLVE',[status(thm)],[17,'SOLVE-$$LESS-BY-$$$LESS']) ).
tff(20,plain,
read('SKOLEMAAAV1.array',4) = 44,
inference('PARAMODULATE',[status(thm)],[1,15,theory(equality)]) ).
tff(21,plain,
! [X: $int] :
( ( 4 = X )
| ( read('SKOLEMAAAV1.array',X) = read(write(write(write('SKOLEMAAAV2.array',3,33),4,444),5,55),X) ) ),
inference('PARAMODULATE',[status(thm)],[2,15,theory(equality)]) ).
tff(22,plain,
read('SKOLEMAAAV1.array',5) = 55,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,21,theory(equality)]),theory(equality)]) ).
tff(23,plain,
! [X: $int] :
( ( 4 = X )
| ( 5 = X )
| ( read('SKOLEMAAAV1.array',X) = read(write(write('SKOLEMAAAV2.array',3,33),4,444),X) ) ),
inference('PARAMODULATE',[status(thm)],[2,21,theory(equality)]) ).
tff(24,plain,
! [X: $int] :
( ( 4 = X )
| ( 5 = X )
| ( read('SKOLEMAAAV1.array',X) = read(write('SKOLEMAAAV2.array',3,33),X) ) ),
inference('PARAMODULATE',[status(thm)],[2,23,theory(equality)]) ).
tff(25,plain,
read('SKOLEMAAAV1.array',3) = 33,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,24,theory(equality)]),theory(equality)]) ).
tff(26,plain,
! [X: $int] :
( ( 4 = X )
| ( 5 = X )
| ( 3 = X )
| ( read('SKOLEMAAAV1.array',X) = read('SKOLEMAAAV2.array',X) ) ),
inference('PARAMODULATE',[status(thm)],[2,24,theory(equality)]) ).
tff(28,plain,
! [X: $int] :
( ( 4 = X )
| ( 5 = X )
| ( 3 = X )
| $less(read('SKOLEMAAAV1.array',X),100) ),
inference('PARAMODULATE',[status(thm)],[16,26,theory(equality)]) ).
tff(29,plain,
( ( 4 = 'SKOLEMAAAV3.$int' )
| ( 5 = 'SKOLEMAAAV3.$int' )
| ( 3 = 'SKOLEMAAAV3.$int' ) ),
inference('HYPERRESOLVE',[status(thm)],[17,28]) ).
tff(30,plain,
( ( 4 = 'SKOLEMAAAV3.$int' )
| ( 3 = 'SKOLEMAAAV3.$int' ) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,29,theory(equality)]),'CODE-FOR-$$$LESS',22,theory(equality)]) ).
tff(31,plain,
3 = 'SKOLEMAAAV3.$int',
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,30,theory(equality)]),'CODE-FOR-$$$LESS',20,theory(equality)]) ).
cnf(32,plain,
$false,
inference('REWRITE',[status(thm)],[17,'CODE-FOR-$$LESS',25,31,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT010_1 : TPTP v8.1.0. Released v5.0.0.
% 0.13/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n008.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 18:52:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 0.20/0.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 0.20/0.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T18:52:23
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n008.cluster.edu at 2022-07-01T18:52:23
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 #||
% 0.20/0.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.51 % SZS output start Refutation
% See solution above
% 0.20/0.51 ||#
% 0.20/0.51
% 0.20/0.51 ; Summary of computation:
% 0.20/0.51 ; 68 formulas have been input or derived (from 31 formulas).
% 0.20/0.51 ; 32 (47%) were retained. Of these,
% 0.20/0.51 ; 4 (12%) were simplified or subsumed later,
% 0.20/0.51 ; 28 (88%) are still being kept.
% 0.20/0.51 ;
% 0.20/0.51 ; Run time in seconds excluding printing time:
% 0.20/0.51 ; 0.002 5% Read assertion file (1 call)
% 0.20/0.51 ; 0.001 3% Assert (3 calls)
% 0.20/0.51 ; 0.007 19% Process new row (60 calls)
% 0.20/0.51 ; 0.000 0% Resolution (60 calls)
% 0.20/0.51 ; 0.002 5% Paramodulation (30 calls)
% 0.20/0.51 ; 0.000 0% Factoring (13 calls)
% 0.20/0.51 ; 0.000 0% Condensing (18 calls)
% 0.20/0.51 ; 0.000 0% Forward subsumption (18 calls)
% 0.20/0.51 ; 0.000 0% Backward subsumption (17 calls)
% 0.20/0.51 ; 0.001 3% Clause clause subsumption (5 calls)
% 0.20/0.51 ; 0.000 0% Forward simplification (58 calls)
% 0.20/0.51 ; 0.000 0% Backward simplification (32 calls)
% 0.20/0.51 ; 0.000 0% Ordering (204 calls)
% 0.20/0.51 ; 0.001 3% Sortal reasoning (174 calls)
% 0.20/0.51 ; 0.000 0% Purity testing (1 call)
% 0.20/0.51 ; 0.023 62% Other
% 0.20/0.51 ; 0.037 Total
% 0.20/0.51 ; 0.039 Real time
% 0.20/0.51 ;
% 0.20/0.51 ; Term-hash-array has 51 terms in all.
% 0.20/0.51 ; Feature-vector-row-index has 15 entries (16 at peak, 17 added, 2 deleted).
% 0.20/0.51 ; Feature-vector-row-index has 99 nodes (106 at peak, 112 added, 13 deleted).
% 0.20/0.51 ; Retrieved 6 possibly forward subsuming rows in 18 calls.
% 0.20/0.51 ; Retrieved 1 possibly backward subsumed row in 17 calls.
% 0.20/0.51 ; Path-index has 57 entries (62 at peak, 65 added, 8 deleted).
% 0.20/0.51 ; Path-index has 208 nodes (211 at peak, 213 added, 5 deleted).
% 0.20/0.51 ; Trie-index has 57 entries (62 at peak, 65 added, 8 deleted).
% 0.20/0.51 ; Trie-index has 173 nodes (180 at peak, 183 added, 10 deleted).
% 0.20/0.51 ; Retrieved 23 generalization terms in 54 calls.
% 0.20/0.51 ; Retrieved 14 instance terms in 14 calls.
% 0.20/0.51 ; Retrieved 94 unifiable terms in 139 calls.
% 0.20/0.51 ;
% 0.20/0.51 ; The agenda of backward simplifiable rows to process has 2 entries:
% 0.20/0.51 ; 2 with value 0
% 0.20/0.51 ; The agenda of rows to process has 2 entries:
% 0.20/0.51 ; 1 with value 19 1 with value 20
% 0.20/0.51 ; The agenda of rows to give has 1 entry:
% 0.20/0.51 ; 1 with value (4 12)
% 0.20/0.51 Evaluation took:
% 0.20/0.51 0.039 seconds of real time
% 0.20/0.51 0.033385 seconds of user run time
% 0.20/0.51 0.005161 seconds of system run time
% 0.20/0.51 0 calls to %EVAL
% 0.20/0.51 0 page faults and
% 0.20/0.51 3,193,312 bytes consed.
% 0.20/0.51 :PROOF-FOUND
% 0.20/0.51 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T18:52:23
% 0.20/0.51 :PROOF-FOUND
% 0.20/0.51 *
%------------------------------------------------------------------------------