TSTP Solution File: CAT010-10 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : CAT010-10 : TPTP v8.1.0. Released v7.3.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:08 EDT 2022
% Result : Unsatisfiable 1.93s 2.14s
% Output : Refutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 8 RR)
% Number of literals : 18 ( 17 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 : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 20 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ifeq_axiom_001,axiom,
ifeq2(X,X,Y,Z) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom_001) ).
cnf(ifeq_axiom_002,axiom,
ifeq(X,X,Y,Z) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom_002) ).
cnf(domain_has_elements,axiom,
ifeq(there_exists(domain(X)),true,there_exists(X),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain_has_elements) ).
cnf(composition_implies_domain,axiom,
ifeq(there_exists(compose(X,Y)),true,there_exists(domain(X)),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',composition_implies_domain) ).
cnf(domain_codomain_composition1,axiom,
ifeq2(there_exists(compose(X,Y)),true,domain(X),codomain(Y)) = codomain(Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain_codomain_composition1) ).
cnf(associativity_of_compose,axiom,
compose(X,compose(Y,Z)) = compose(compose(X,Y),Z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_compose) ).
cnf(compose_codomain,axiom,
compose(codomain(X),X) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',compose_codomain) ).
cnf(ab_exists,hypothesis,
there_exists(compose(a,b)) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ab_exists) ).
cnf(prove_codomain_of_ab_equals_codomain_of_a,negated_conjecture,
codomain(compose(a,b)) != codomain(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_codomain_of_ab_equals_codomain_of_a) ).
cnf(22,plain,
compose(codomain(X),compose(X,Y)) = compose(X,Y),
inference('PARAMODULATE',[status(thm)],[associativity_of_compose,compose_codomain,theory(equality)]) ).
cnf(30,plain,
there_exists(domain(a)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[composition_implies_domain,ab_exists,theory(equality)]),ifeq_axiom_002,theory(equality)]) ).
cnf(35,plain,
domain(a) = codomain(b),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[domain_codomain_composition1,ab_exists,theory(equality)]),ifeq_axiom_001,theory(equality)]) ).
cnf(36,plain,
there_exists(codomain(b)) = true,
inference('REWRITE',[status(thm)],[30,35,theory(equality)]) ).
cnf(37,plain,
ifeq2(there_exists(X),true,domain(codomain(X)),codomain(X)) = codomain(X),
inference('PARAMODULATE',[status(thm)],[domain_codomain_composition1,compose_codomain,theory(equality)]) ).
cnf(46,plain,
there_exists(a) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[domain_has_elements,35,theory(equality)]),ifeq_axiom_002,36,theory(equality)]) ).
cnf(84,plain,
ifeq2(there_exists(compose(X,Y)),true,domain(codomain(X)),codomain(compose(X,Y))) = codomain(compose(X,Y)),
inference('PARAMODULATE',[status(thm)],[domain_codomain_composition1,22,theory(equality)]) ).
cnf(202,plain,
domain(codomain(a)) = codomain(a),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[37,46,theory(equality)]),ifeq_axiom_001,theory(equality)]) ).
cnf(2664,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[84,ab_exists,theory(equality)]),prove_codomain_of_ab_equals_codomain_of_a,ifeq_axiom_001,202,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : CAT010-10 : TPTP v8.1.0. Released v7.3.0.
% 0.00/0.10 % Command : run-snark %s %d
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Sun May 29 22:17:12 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.14/0.38 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.38 *
% 0.14/0.38 *
% 0.14/0.39 #<PACKAGE "SNARK-USER">
% 0.14/0.39 *
% 0.14/0.39 SNARK-TPTP-OPTIONS
% 0.14/0.39 *
% 0.14/0.39 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.14/0.39 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.14/0.39 (USE-FACTORING :POS)
% 0.14/0.39 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.14/0.39 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.14/0.39 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.14/0.39 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.14/0.39 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.14/0.39 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.14/0.39 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.14/0.39 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.14/0.39 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.14/0.39 (DECLARE-TPTP-SYMBOLS2))
% 0.14/0.39 *
% 0.14/0.39 "."
% 0.14/0.39 *
% 0.14/0.39 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T22:17:12
% 0.14/0.39 ; 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-29T22:17:12
% 0.14/0.40
% 1.93/2.14 ; Recognized associativity assertion (= (|compose| ?X (|compose| ?Y ?Z)) (|compose| (|compose| ?X ?Y) ?Z)).
% 1.93/2.14
% 1.93/2.14 #||
% 1.93/2.14 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.93/2.14 % SZS output start Refutation
% See solution above
% 1.93/2.15 ||#
% 1.93/2.15
% 1.93/2.15 ; Summary of computation:
% 1.93/2.15 ; 9841 formulas have been input or derived (from 196 formulas).
% 1.93/2.15 ; 2664 (27%) were retained. Of these,
% 1.93/2.15 ; 211 ( 8%) were simplified or subsumed later,
% 1.93/2.15 ; 2453 (92%) are still being kept.
% 1.93/2.15 ;
% 1.93/2.15 ; Run time in seconds excluding printing time:
% 1.93/2.15 ; 0.001 0% Read assertion file (1 call)
% 1.93/2.15 ; 0.001 0% Assert (16 calls)
% 1.93/2.15 ; 0.268 15% Process new row (9,287 calls)
% 1.93/2.15 ; 0.008 0% Resolution (390 calls)
% 1.93/2.15 ; 0.119 7% Paramodulation (195 calls)
% 1.93/2.15 ; 0.467 27% Forward simplification (9,272 calls)
% 1.93/2.15 ; 0.124 7% Backward simplification (2,664 calls)
% 1.93/2.15 ; 0.726 41% Ordering (109,056 calls)
% 1.93/2.15 ; 0.000 0% Sortal reasoning (32 calls)
% 1.93/2.15 ; 0.000 0% Purity testing (1 call)
% 1.93/2.15 ; 0.042 2% Other
% 1.93/2.15 ; 1.756 Total
% 1.93/2.15 ; 1.757 Real time
% 1.93/2.15 ;
% 1.93/2.15 ; Term-hash-array has 7,202 terms in all.
% 1.93/2.15 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 1.93/2.15 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 1.93/2.15 ; Path-index has 6,737 entries (6,737 at peak, 7,210 added, 473 deleted).
% 1.93/2.15 ; Path-index has 13,172 nodes (13,172 at peak, 13,762 added, 590 deleted).
% 1.93/2.15 ; Trie-index has 6,737 entries (6,737 at peak, 7,210 added, 473 deleted).
% 1.93/2.15 ; Trie-index has 42,597 nodes (42,597 at peak, 45,287 added, 2,690 deleted).
% 1.93/2.15 ; Retrieved 73,181 generalization terms in 90,141 calls.
% 1.93/2.15 ; Retrieved 9,847 instance terms in 3,547 calls.
% 1.93/2.15 ; Retrieved 19,268 unifiable terms in 1,592 calls.
% 1.93/2.15 ;
% 1.93/2.15 ; The agenda of rows to process has 73 entries:
% 1.93/2.15 ; 1 with value 23 5 with value 30 5 with value 36
% 1.93/2.15 ; 2 with value 25 3 with value 31 1 with value 37
% 1.93/2.15 ; 5 with value 26 7 with value 32 1 with value 38
% 1.93/2.15 ; 4 with value 27 6 with value 33 8 with value 39
% 1.93/2.15 ; 2 with value 28 5 with value 34 2 with value 41
% 1.93/2.15 ; 5 with value 29 5 with value 35 6 with value 43
% 1.93/2.15 ; The agenda of rows to give has 2280 entries:
% 1.93/2.15 ; 36 with value (4 24) 205 with value (4 33) 41 with value (4 42)
% 1.93/2.15 ; 49 with value (4 25) 182 with value (4 34) 4 with value (4 43)
% 1.93/2.15 ; 116 with value (4 26) 124 with value (4 35) 4 with value (4 44)
% 1.93/2.15 ; 75 with value (4 27) 104 with value (4 36) 1 with value (4 45)
% 1.93/2.15 ; 107 with value (4 28) 147 with value (4 37) 5 with value (4 46)
% 1.93/2.15 ; 135 with value (4 29) 116 with value (4 38) 3 with value (4 47)
% 1.93/2.15 ; 164 with value (4 30) 37 with value (4 39) 1 with value (4 49)
% 1.93/2.15 ; 306 with value (4 31) 32 with value (4 40) 4 with value (4 50)
% 1.93/2.15 ; 250 with value (4 32) 32 with value (4 41)
% 1.93/2.15 Evaluation took:
% 1.93/2.15 1.758 seconds of real time
% 1.93/2.15 1.58499 seconds of user run time
% 1.93/2.15 0.173013 seconds of system run time
% 1.93/2.15 [Run times include 0.145 seconds GC run time.]
% 1.93/2.15 0 calls to %EVAL
% 1.93/2.15 0 page faults and
% 1.93/2.15 129,618,416 bytes consed.
% 1.93/2.15 :PROOF-FOUND
% 1.93/2.15 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T22:17:13
% 1.93/2.15 :PROOF-FOUND
% 1.93/2.15 *
%------------------------------------------------------------------------------