TSTP Solution File: COL052-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : COL052-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n024.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 : Fri Jul 15 00:41:42 EDT 2022
% Result : Unsatisfiable 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 10 ( 8 unt; 0 nHn; 8 RR)
% Number of literals : 12 ( 6 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 11 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(composer_exists,axiom,
response(compose(X,Y),Z) = response(X,response(Y,Z)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',composer_exists) ).
cnf(agreeable1,axiom,
( ~ agreeable(X)
| response(X,common_bird(Y)) = response(Y,common_bird(Y)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',agreeable1) ).
cnf(agreeable2,axiom,
( response(X,Y) != response(compatible(X),Y)
| agreeable(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',agreeable2) ).
cnf(c_is_agreeable,hypothesis,
agreeable(c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_agreeable) ).
cnf(prove_a_is_agreeable,negated_conjecture,
~ agreeable(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_is_agreeable) ).
cnf(c_composes_a_with_b,hypothesis,
c = compose(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_composes_a_with_b) ).
cnf(10,plain,
response(a,X) != response(compatible(a),X),
inference('UR-RESOLVE',[status(thm)],[agreeable2,prove_a_is_agreeable]) ).
cnf(16,plain,
response(compose(a,X),Y) != response(compose(compatible(a),X),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,composer_exists,theory(equality)]),composer_exists,theory(equality)]) ).
cnf(28,plain,
~ agreeable(compose(a,X)),
inference('UR-RESOLVE',[status(thm)],[agreeable1,16]) ).
cnf(35,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[28,c_composes_a_with_b,theory(equality)]),c_is_agreeable]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : COL052-2 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n024.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 : Tue May 31 15:42:51 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p 2022-05-31T15:42:51
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2022-05-31T15:42:51
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 #||
% 0.20/0.52 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.52 % SZS output start Refutation
% See solution above
% 0.20/0.52 ||#
% 0.20/0.52
% 0.20/0.52 ; Summary of computation:
% 0.20/0.52 ; 56 formulas have been input or derived (from 15 formulas).
% 0.20/0.52 ; 35 (62%) were retained. Of these,
% 0.20/0.52 ; 35 (100%) are still being kept.
% 0.20/0.52 ;
% 0.20/0.52 ; Run time in seconds:
% 0.20/0.52 ; 0.002 6% Read assertion file (1 call)
% 0.20/0.52 ; 0.000 0% Assert (6 calls)
% 0.20/0.52 ; 0.005 14% Process new row (53 calls)
% 0.20/0.52 ; 0.001 3% Resolution (28 calls)
% 0.20/0.52 ; 0.002 6% Paramodulation (14 calls)
% 0.20/0.52 ; 0.000 0% Condensing (7 calls)
% 0.20/0.52 ; 0.001 3% Forward subsumption (7 calls)
% 0.20/0.52 ; 0.000 0% Backward subsumption (7 calls)
% 0.20/0.52 ; 0.001 3% Clause clause subsumption (3 calls)
% 0.20/0.52 ; 0.000 0% Forward simplification (53 calls)
% 0.20/0.52 ; 0.000 0% Backward simplification (35 calls)
% 0.20/0.52 ; 0.001 3% Ordering (152 calls)
% 0.20/0.52 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.52 ; 0.000 0% Purity testing (1 call)
% 0.20/0.52 ; 0.022 63% Other
% 0.20/0.52 ; 0.035 Total
% 0.20/0.52 ; 0.036 Real time
% 0.20/0.52 ;
% 0.20/0.52 ; Term-hash-array has 111 terms in all.
% 0.20/0.52 ; Feature-vector-row-index has 7 entries (7 at peak, 7 added, 0 deleted).
% 0.20/0.52 ; Feature-vector-row-index has 43 nodes (43 at peak, 43 added, 0 deleted).
% 0.20/0.52 ; Retrieved 3 possibly forward subsuming rows in 7 calls.
% 0.20/0.52 ; Retrieved 0 possibly backward subsumed rows in 7 calls.
% 0.20/0.52 ; Path-index has 114 entries (114 at peak, 114 added, 0 deleted).
% 0.20/0.52 ; Path-index has 233 nodes (233 at peak, 233 added, 0 deleted).
% 0.20/0.52 ; Trie-index has 114 entries (114 at peak, 114 added, 0 deleted).
% 0.20/0.52 ; Trie-index has 441 nodes (441 at peak, 441 added, 0 deleted).
% 0.20/0.52 ; Retrieved 129 generalization terms in 193 calls.
% 0.20/0.52 ; Retrieved 45 instance terms in 41 calls.
% 0.20/0.52 ; Retrieved 252 unifiable terms in 97 calls.
% 0.20/0.52 ;
% 0.20/0.52 ; The agenda of rows to process has 1 entry:
% 0.20/0.52 ; 1 with value 20
% 0.20/0.52 ; The agenda of rows to give has 20 entries:
% 0.20/0.52 ; 1 with value (4 11) 5 with value (4 20) 5 with value (4 23)
% 0.20/0.52 ; 1 with value (4 17) 1 with value (4 21) 1 with value (4 24)
% 0.20/0.52 ; 1 with value (4 18) 1 with value (4 22) 1 with value (4 25)
% 0.20/0.52 ; 3 with value (4 19)
% 0.20/0.52 Evaluation took:
% 0.20/0.52 0.037 seconds of real time
% 0.20/0.52 0.031522 seconds of user run time
% 0.20/0.52 0.005251 seconds of system run time
% 0.20/0.52 0 calls to %EVAL
% 0.20/0.52 0 page faults and
% 0.20/0.52 2,170,232 bytes consed.
% 0.20/0.52 :PROOF-FOUND
% 0.20/0.52 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-31T15:42:51
% 0.20/0.52 :PROOF-FOUND
% 0.20/0.52 *
%------------------------------------------------------------------------------