%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : CAT009-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n032.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:07:07 EDT 2022
% Result : Unsatisfiable 0.45s 0.63s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 16 ( 11 unt; 0 nHn; 13 RR)
% Number of literals : 21 ( 9 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 14 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(codomain_has_elements,axiom,
( ~ there_exists(codomain(X))
| there_exists(X) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',codomain_has_elements) ).
cnf(composition_implies_domain,axiom,
( ~ there_exists(compose(X,Y))
| there_exists(domain(X)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',composition_implies_domain) ).
cnf(domain_codomain_composition1,axiom,
( ~ there_exists(compose(X,Y))
| domain(X) = codomain(Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',domain_codomain_composition1) ).
cnf(associativity_of_compose,axiom,
compose(X,compose(Y,Z)) = compose(compose(X,Y),Z),
file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',associativity_of_compose) ).
cnf(compose_domain,axiom,
compose(X,domain(X)) = X,
file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',compose_domain) ).
cnf(ab_exists,hypothesis,
there_exists(compose(a,b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ab_exists) ).
cnf(prove_domain_of_ab_equals_domain_of_b,negated_conjecture,
domain(compose(a,b)) != domain(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_of_ab_equals_domain_of_b) ).
cnf(25,plain,
there_exists(domain(a)),
inference('HYPERRESOLVE',[status(thm)],[composition_implies_domain,ab_exists]) ).
cnf(31,plain,
domain(a) = codomain(b),
inference('HYPERRESOLVE',[status(thm)],[domain_codomain_composition1,ab_exists]) ).
cnf(32,plain,
there_exists(codomain(b)),
inference('REWRITE',[status(thm)],[25,31,theory(equality)]) ).
cnf(34,plain,
( ~ there_exists(X)
| domain(X) = codomain(domain(X)) ),
inference('PARAMODULATE',[status(thm)],[domain_codomain_composition1,compose_domain,theory(equality)]) ).
cnf(35,plain,
compose(X,Y) = compose(compose(X,Y),domain(Y)),
inference('PARAMODULATE',[status(thm)],[associativity_of_compose,compose_domain,theory(equality)]) ).
cnf(66,plain,
there_exists(b),
inference('HYPERRESOLVE',[status(thm)],[codomain_has_elements,32]) ).
cnf(221,plain,
domain(b) = codomain(domain(b)),
inference('HYPERRESOLVE',[status(thm)],[34,66]) ).
cnf(238,plain,
( ~ there_exists(compose(X,Y))
| domain(compose(X,Y)) = codomain(domain(Y)) ),
inference('PARAMODULATE',[status(thm)],[domain_codomain_composition1,35,theory(equality)]) ).
cnf(612,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[238,ab_exists]),prove_domain_of_ab_equals_domain_of_b,221,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CAT009-3 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : run-snark %s %d
% 0.12/0.31 % Computer : n032.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 600
% 0.12/0.31 % DateTime : Sun May 29 20:18:11 EDT 2022
% 0.12/0.31 % CPUTime :
% 0.17/0.40 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.41 *
% 0.17/0.41 *
% 0.17/0.41 #<PACKAGE "SNARK-USER">
% 0.17/0.41 *
% 0.17/0.41 SNARK-TPTP-OPTIONS
% 0.17/0.41 *
% 0.17/0.41 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.17/0.42 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.17/0.42 (USE-FACTORING :POS)
% 0.17/0.42 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.17/0.42 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.17/0.42 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.17/0.42 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.17/0.42 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.17/0.42 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.17/0.42 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.17/0.42 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.17/0.42 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.17/0.42 (DECLARE-TPTP-SYMBOLS2))
% 0.17/0.42 *
% 0.17/0.42 "."
% 0.17/0.42 *
% 0.17/0.42 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T20:18:12
% 0.17/0.42 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n032.cluster.edu at 2022-05-29T20:18:12
% 0.17/0.42
% 0.45/0.63 ; Recognized associativity assertion (= (|compose| ?X (|compose| ?Y ?Z)) (|compose| (|compose| ?X ?Y) ?Z)).
% 0.45/0.63
% 0.45/0.63 #||
% 0.45/0.63 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.63 % SZS output start Refutation
% See solution above
% 0.45/0.63 ||#
% 0.45/0.63
% 0.45/0.63 ; Summary of computation:
% 0.45/0.63 ; 2371 formulas have been input or derived (from 127 formulas).
% 0.45/0.63 ; 612 (26%) were retained. Of these,
% 0.45/0.63 ; 147 (24%) were simplified or subsumed later,
% 0.45/0.63 ; 465 (76%) are still being kept.
% 0.45/0.63 ;
% 0.45/0.63 ; Run time in seconds excluding printing time:
% 0.45/0.63 ; 0.003 1% Read assertion file (1 call)
% 0.45/0.63 ; 0.000 0% Assert (19 calls)
% 0.45/0.63 ; 0.050 24% Process new row (2,183 calls)
% 0.45/0.63 ; 0.029 14% Resolution (252 calls)
% 0.45/0.63 ; 0.012 6% Paramodulation (126 calls)
% 0.45/0.63 ; 0.000 0% Factoring (15 calls)
% 0.45/0.63 ; 0.007 3% Condensing (740 calls)
% 0.45/0.63 ; 0.033 16% Forward subsumption (740 calls)
% 0.45/0.63 ; 0.006 3% Backward subsumption (390 calls)
% 0.45/0.63 ; 0.006 3% Clause clause subsumption (2,285 calls)
% 0.45/0.63 ; 0.030 14% Forward simplification (2,163 calls)
% 0.45/0.63 ; 0.005 2% Backward simplification (612 calls)
% 0.45/0.63 ; 0.008 4% Ordering (2,222 calls)
% 0.45/0.63 ; 0.001 0% Sortal reasoning (32 calls)
% 0.45/0.63 ; 0.000 0% Purity testing (1 call)
% 0.45/0.63 ; 0.020 10% Other
% 0.45/0.63 ; 0.210 Total
% 0.45/0.63 ; 0.212 Real time
% 0.45/0.63 ;
% 0.45/0.63 ; Term-hash-array has 1,124 terms in all.
% 0.45/0.63 ; Feature-vector-row-index has 339 entries (339 at peak, 390 added, 51 deleted).
% 0.45/0.63 ; Feature-vector-row-index has 1,563 nodes (1,563 at peak, 1,740 added, 177 deleted).
% 0.45/0.63 ; Retrieved 2,752 possibly forward subsuming rows in 740 calls.
% 0.45/0.63 ; Retrieved 226 possibly backward subsumed rows in 390 calls.
% 0.45/0.63 ; Path-index has 794 entries (794 at peak, 1,126 added, 332 deleted).
% 0.45/0.63 ; Path-index has 3,455 nodes (3,455 at peak, 3,893 added, 438 deleted).
% 0.45/0.63 ; Trie-index has 794 entries (794 at peak, 1,126 added, 332 deleted).
% 0.45/0.63 ; Trie-index has 3,441 nodes (3,441 at peak, 4,478 added, 1,037 deleted).
% 0.45/0.63 ; Retrieved 3,913 generalization terms in 11,837 calls.
% 0.45/0.63 ; Retrieved 234 instance terms in 233 calls.
% 0.45/0.63 ; Retrieved 11,915 unifiable terms in 1,546 calls.
% 0.45/0.63 ;
% 0.45/0.63 ; The agenda of rows to process has 20 entries:
% 0.45/0.63 ; 1 with value 15 1 with value 20 1 with value 25
% 0.45/0.63 ; 1 with value 16 5 with value 22 2 with value 26
% 0.45/0.63 ; 2 with value 17 2 with value 23 1 with value 28
% 0.45/0.63 ; 1 with value 19 1 with value 24 2 with value 31
% 0.45/0.63 ; The agenda of rows to give has 350 entries:
% 0.45/0.63 ; 21 with value (4 19) 24 with value (4 25) 8 with value (4 31)
% 0.45/0.63 ; 39 with value (4 20) 30 with value (4 26) 2 with value (4 32)
% 0.45/0.63 ; 29 with value (4 21) 32 with value (4 27) 8 with value (4 33)
% 0.45/0.63 ; 37 with value (4 22) 8 with value (4 28) 4 with value (4 35)
% 0.45/0.63 ; 19 with value (4 23) 1 with value (4 29) 4 with value (4 39)
% 0.45/0.63 ; 47 with value (4 24) 37 with value (4 30)
% 0.45/0.63 Evaluation took:
% 0.45/0.63 0.212 seconds of real time
% 0.45/0.63 0.18801 seconds of user run time
% 0.45/0.63 0.024135 seconds of system run time
% 0.45/0.63 [Run times include 0.009 seconds GC run time.]
% 0.45/0.63 0 calls to %EVAL
% 0.45/0.63 0 page faults and
% 0.45/0.63 16,254,944 bytes consed.
% 0.45/0.63 :PROOF-FOUND
% 0.45/0.63 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T20:18:12
% 0.45/0.63 :PROOF-FOUND
% 0.45/0.63 *
%------------------------------------------------------------------------------