TSTP Solution File: ARI338_1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : ARI338_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 : Thu Jul 14 22:08:26 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-$$SUM')
% Comments :
%------------------------------------------------------------------------------
tff('SOLVE-$$LESS-BY-$$$LESS',axiom,
! [X: 'NUMBER',Y: 'NUMBER'] :
( $less(X,Y)
| ~ '$$$LESS'(X,Y) ) ).
tff(13,negated_conjecture,
! [X: $rat,Y: $rat] :
( ( $sum(X,1) != Y )
| ~ $less(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rat_combined_problem_4) ).
tff(14,plain,
! [X: $rat,Y: $rat] :
( ( $sum(1,X) != Y )
| ~ $less(X,Y) ),
inference('REWRITE',[status(thm)],[13,'CODE-FOR-$$SUM']) ).
cnf(15,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[14,'SOLVE-$$LESS-BY-$$$LESS',theory(equality)]),'CODE-FOR-$$$LESS','CODE-FOR-$$SUM','CODE-FOR-$$PRODUCT']) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ARI338_1 : TPTP v8.1.0. Released v5.0.0.
% 0.07/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 Jun 17 13:34:07 EDT 2022
% 0.13/0.35 % 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-06-17T13:34:07
% 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-06-17T13:34:07
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 #||
% 0.20/0.51 % SZS status Theorem for /export/starexec/sandbox2/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 ; 28 formulas have been input or derived (from 14 formulas).
% 0.20/0.51 ; 15 (54%) were retained. Of these,
% 0.20/0.51 ; 1 ( 7%) were simplified or subsumed later,
% 0.20/0.51 ; 14 (93%) are still being kept.
% 0.20/0.51 ;
% 0.20/0.51 ; Run time in seconds excluding printing time:
% 0.20/0.51 ; 0.001 4% Read assertion file (1 call)
% 0.20/0.51 ; 0.000 0% Assert (1 call)
% 0.20/0.51 ; 0.001 4% Process new row (24 calls)
% 0.20/0.51 ; 0.000 0% Resolution (26 calls)
% 0.20/0.51 ; 0.000 0% Paramodulation (13 calls)
% 0.20/0.51 ; 0.000 0% Factoring (4 calls)
% 0.20/0.51 ; 0.000 0% Condensing (9 calls)
% 0.20/0.51 ; 0.000 0% Forward subsumption (9 calls)
% 0.20/0.51 ; 0.000 0% Backward subsumption (9 calls)
% 0.20/0.51 ; 0.000 0% Forward simplification (24 calls)
% 0.20/0.51 ; 0.001 4% Backward simplification (14 calls)
% 0.20/0.51 ; 0.001 4% Sortal reasoning (65 calls)
% 0.20/0.51 ; 0.000 0% Purity testing (1 call)
% 0.20/0.51 ; 0.023 85% Other
% 0.20/0.51 ; 0.027 Total
% 0.20/0.51 ; 0.028 Real time
% 0.20/0.51 ;
% 0.20/0.51 ; Term-hash-array has 13 terms in all.
% 0.20/0.51 ; Feature-vector-row-index has 9 entries (9 at peak, 9 added, 0 deleted).
% 0.20/0.51 ; Feature-vector-row-index has 16 nodes (16 at peak, 16 added, 0 deleted).
% 0.20/0.51 ; Retrieved 0 possibly forward subsuming rows in 9 calls.
% 0.20/0.51 ; Retrieved 0 possibly backward subsumed rows in 9 calls.
% 0.20/0.51 ; Path-index has 16 entries (16 at peak, 16 added, 0 deleted).
% 0.20/0.51 ; Path-index has 37 nodes (37 at peak, 37 added, 0 deleted).
% 0.20/0.51 ; Trie-index has 16 entries (16 at peak, 16 added, 0 deleted).
% 0.20/0.51 ; Trie-index has 23 nodes (23 at peak, 23 added, 0 deleted).
% 0.20/0.51 ; Retrieved 13 generalization terms in 13 calls.
% 0.20/0.51 ; Retrieved 4 instance terms in 4 calls.
% 0.20/0.51 ; Retrieved 41 unifiable terms in 34 calls.
% 0.20/0.51 ;
% 0.20/0.51 ; The agenda of rows to process has 1 entry:
% 0.20/0.51 ; 1 with value 8
% 0.20/0.51 Evaluation took:
% 0.20/0.51 0.029 seconds of real time
% 0.20/0.51 0.021375 seconds of user run time
% 0.20/0.51 0.006893 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 1,530,416 bytes consed.
% 0.20/0.51 :PROOF-FOUND
% 0.20/0.51 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-17T13:34:07
% 0.20/0.51 :PROOF-FOUND
% 0.20/0.51 *
%------------------------------------------------------------------------------