TSTP Solution File: SYN083-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SYN083-1 : TPTP v8.1.0. Released v1.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 : Thu Jul 21 11:57:29 EDT 2022
% Result : Unsatisfiable 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 2
% Syntax : Number of clauses : 3 ( 3 unt; 0 nHn; 2 RR)
% Number of literals : 3 ( 2 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f_is_associative,axiom,
f(X,f(Y,Z)) = f(f(X,Y),Z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f_is_associative) ).
cnf(prove_this,negated_conjecture,
f(a,f(b,f(c,d))) != f(f(f(a,b),c),d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(3,plain,
$false,
inference('REWRITE',[status(thm)],[prove_this,f_is_associative,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN083-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n009.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 : Mon Jul 11 14:08:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 2022-07-11T14:08:52
% 0.20/0.47 ; 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-11T14:08:52
% 0.20/0.48
% 0.20/0.49 ; Recognized associativity assertion (= (|f| ?X (|f| ?Y ?Z)) (|f| (|f| ?X ?Y) ?Z)).
% 0.20/0.49
% 0.20/0.49 #||
% 0.20/0.49 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49 % SZS output start Refutation
% See solution above
% 0.20/0.49 ||#
% 0.20/0.49
% 0.20/0.49 ; Summary of computation:
% 0.20/0.49 ; 3 formulas have been input or derived (from 1 formulas).
% 0.20/0.49 ; 3 (100%) were retained. Of these,
% 0.20/0.49 ; 1 (33%) were simplified or subsumed later,
% 0.20/0.49 ; 2 (67%) are still being kept.
% 0.20/0.49 ;
% 0.20/0.49 ; Run time in seconds:
% 0.20/0.49 ; 0.000 0% Read assertion file (1 call)
% 0.20/0.49 ; 0.001 4% Assert (2 calls)
% 0.20/0.49 ; 0.001 4% Process new row (2 calls)
% 0.20/0.49 ; 0.000 0% Forward simplification (2 calls)
% 0.20/0.49 ; 0.000 0% Backward simplification (2 calls)
% 0.20/0.49 ; 0.000 0% Ordering (16 calls)
% 0.20/0.49 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.49 ; 0.000 0% Purity testing (1 call)
% 0.20/0.49 ; 0.021 91% Other
% 0.20/0.49 ; 0.023 Total
% 0.20/0.49 ; 0.025 Real time
% 0.20/0.49 ;
% 0.20/0.49 ; Term-hash-array has 5 terms in all.
% 0.20/0.49 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.20/0.49 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.20/0.49 ; Path-index has 9 entries (9 at peak, 9 added, 0 deleted).
% 0.20/0.49 ; Path-index has 36 nodes (36 at peak, 36 added, 0 deleted).
% 0.20/0.49 ; Trie-index has 9 entries (9 at peak, 9 added, 0 deleted).
% 0.20/0.49 ; Trie-index has 26 nodes (26 at peak, 26 added, 0 deleted).
% 0.20/0.49 ; Retrieved 12 generalization terms in 16 calls.
% 0.20/0.49 ; Retrieved 3 instance terms in 3 calls.
% 0.20/0.49 ;
% 0.20/0.49 ; The agenda of input rows to give has 1 entry:
% 0.20/0.49 ; 1 with value 14
% 0.20/0.49 Evaluation took:
% 0.20/0.49 0.025 seconds of real time
% 0.20/0.49 0.022148 seconds of user run time
% 0.20/0.49 0.002826 seconds of system run time
% 0.20/0.49 0 calls to %EVAL
% 0.20/0.49 0 page faults and
% 0.20/0.49 1,272,656 bytes consed.
% 0.20/0.49 :PROOF-FOUND
% 0.20/0.49 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-11T14:08:52
% 0.20/0.49 :PROOF-FOUND
% 0.20/0.49 *
%------------------------------------------------------------------------------