TSTP Solution File: SEU225+3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SEU225+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n026.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 : Tue Jul 19 14:20:21 EDT 2022
% Result : Theorem 3.42s 3.60s
% Output : Refutation 3.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 15 ( 10 unt; 1 nHn; 10 RR)
% Number of literals : 32 ( 6 equ; 20 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,axiom,
( ~ relation(X)
| ~ function(X)
| in(Y,relation_dom(X))
| Z = apply(X,Y)
| Z != empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_funct_1) ).
cnf(9,axiom,
( ~ relation(X)
| relation(relation_dom_restriction(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k7_relat_1) ).
cnf(20,axiom,
( ~ relation(X)
| ~ function(X)
| function(relation_dom_restriction(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc4_funct_1) ).
cnf(27,axiom,
( ~ relation(X)
| ~ function(X)
| in(Y,relation_dom(relation_dom_restriction(X,Z)))
| ~ in(Y,relation_dom(X))
| ~ in(Y,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l82_funct_1) ).
cnf(56,axiom,
( ~ relation(X)
| ~ function(X)
| ~ relation(Y)
| ~ function(Y)
| X != relation_dom_restriction(Y,Z)
| ~ in(U,relation_dom(X))
| apply(X,U) = apply(Y,U) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t68_funct_1) ).
cnf(60,negated_conjecture,
relation('SKOLEMAAAV15'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t72_funct_1) ).
cnf(61,negated_conjecture,
function('SKOLEMAAAV15'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t72_funct_1) ).
cnf(62,negated_conjecture,
in('SKOLEMAAAV14','SKOLEMAAAV13'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t72_funct_1) ).
cnf(63,negated_conjecture,
apply(relation_dom_restriction('SKOLEMAAAV15','SKOLEMAAAV13'),'SKOLEMAAAV14') != apply('SKOLEMAAAV15','SKOLEMAAAV14'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t72_funct_1) ).
cnf(89,plain,
relation(relation_dom_restriction('SKOLEMAAAV15',X)),
inference('HYPERRESOLVE',[status(thm)],[9,60]) ).
cnf(127,plain,
function(relation_dom_restriction('SKOLEMAAAV15',X)),
inference('HYPERRESOLVE',[status(thm)],[20,60,61]) ).
cnf(406,plain,
~ in('SKOLEMAAAV14',relation_dom(relation_dom_restriction('SKOLEMAAAV15','SKOLEMAAAV13'))),
inference('UR-RESOLVE',[status(thm)],[56,127,89,60,61,63,theory(equality)]) ).
cnf(7536,plain,
~ in('SKOLEMAAAV14',relation_dom('SKOLEMAAAV15')),
inference('UR-RESOLVE',[status(thm)],[27,406,60,61,62]) ).
cnf(7537,plain,
apply('SKOLEMAAAV15','SKOLEMAAAV14') != empty_set,
inference('UR-RESOLVE',[status(thm)],[7,406,89,127,63]) ).
cnf(7548,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[7,7536,60,61,theory(equality)]),7537]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU225+3 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 06:56:56 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-20T06:56:56
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-06-20T06:56:56
% 0.19/0.49
% 0.19/0.49 ; Recognized commutativity assertion (= (|unordered_pair| ?X ?Y) (|unordered_pair| ?Y ?X)).
% 0.19/0.49 ; Recognized commutativity assertion (= (|set_intersection2| ?X ?Y) (|set_intersection2| ?Y ?X)).
% 0.19/0.49 ; Declaring unordered_pair to be commutative.
% 0.19/0.49 WARNING:
% 0.19/0.49 |one_to_one| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 3.42/3.60 ; Declaring set_intersection2 to be commutative.
% 3.42/3.60
% 3.42/3.60 #||
% 3.42/3.60 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.42/3.60 % SZS output start Refutation
% See solution above
% 3.42/3.60 ||#
% 3.42/3.60
% 3.42/3.60 ; Summary of computation:
% 3.42/3.60 ; 29765 formulas have been input or derived (from 286 formulas).
% 3.42/3.60 ; 7548 (25%) were retained. Of these,
% 3.42/3.60 ; 38 ( 1%) were simplified or subsumed later,
% 3.42/3.60 ; 7510 (99%) are still being kept.
% 3.42/3.60 ;
% 3.42/3.60 ; Run time in seconds excluding printing time:
% 3.42/3.60 ; 0.009 0% Read assertion file (1 call)
% 3.42/3.60 ; 0.002 0% Assert (46 calls)
% 3.42/3.60 ; 0.535 17% Process new row (29,588 calls)
% 3.42/3.60 ; 1.789 57% Resolution (570 calls)
% 3.42/3.60 ; 0.013 0% Paramodulation (285 calls)
% 3.42/3.60 ; 0.000 0% Factoring (4 calls)
% 3.42/3.60 ; 0.002 0% Condensing (206 calls)
% 3.42/3.60 ; 0.006 0% Forward subsumption (206 calls)
% 3.42/3.60 ; 0.004 0% Backward subsumption (96 calls)
% 3.42/3.60 ; 0.001 0% Clause clause subsumption (168 calls)
% 3.42/3.60 ; 0.316 10% Forward simplification (29,560 calls)
% 3.42/3.60 ; 0.330 11% Backward simplification (7,548 calls)
% 3.42/3.60 ; 0.001 0% Ordering (502 calls)
% 3.42/3.60 ; 0.000 0% Sortal reasoning (32 calls)
% 3.42/3.60 ; 0.001 0% Purity testing (1 call)
% 3.42/3.60 ; 0.116 4% Other
% 3.42/3.60 ; 3.125 Total
% 3.42/3.60 ; 3.126 Real time
% 3.42/3.60 ;
% 3.42/3.60 ; Term-hash-array has 15,153 terms in all.
% 3.42/3.60 ; Feature-vector-row-index has 91 entries (91 at peak, 96 added, 5 deleted).
% 3.42/3.60 ; Feature-vector-row-index has 665 nodes (665 at peak, 707 added, 42 deleted).
% 3.42/3.60 ; Retrieved 166 possibly forward subsuming rows in 206 calls.
% 3.42/3.60 ; Retrieved 2 possibly backward subsumed rows in 96 calls.
% 3.42/3.60 ; Path-index has 15,104 entries (15,104 at peak, 15,167 added, 63 deleted).
% 3.42/3.60 ; Path-index has 1,711 nodes (1,711 at peak, 1,755 added, 44 deleted).
% 3.42/3.60 ; Trie-index has 15,104 entries (15,104 at peak, 15,167 added, 63 deleted).
% 3.42/3.60 ; Trie-index has 26,246 nodes (26,246 at peak, 26,385 added, 139 deleted).
% 3.42/3.60 ; Retrieved 48,810 generalization terms in 66,746 calls.
% 3.42/3.60 ; Retrieved 32,615 instance terms in 7,451 calls.
% 3.42/3.60 ; Retrieved 4,898,445 unifiable terms in 169,085 calls.
% 3.42/3.60 ;
% 3.42/3.60 ; The agenda of rows to process has 21 entries:
% 3.42/3.60 ; 4 with value 11 4 with value 15 4 with value 17
% 3.42/3.60 ; 2 with value 12 1 with value 16 1 with value 20
% 3.42/3.60 ; 5 with value 13
% 3.42/3.60 ; The agenda of rows to give has 7236 entries:
% 3.42/3.60 ; 1 with value (4 10) 13 with value (4 20) 4 with value (4 32)
% 3.42/3.60 ; 27 with value (4 11) 17 with value (4 21) 2 with value (4 34)
% 3.42/3.60 ; 28 with value (4 12) 3 with value (4 22) 6 with value (4 35)
% 3.42/3.60 ; 156 with value (4 13) 3 with value (4 23) 1 with value (4 37)
% 3.42/3.60 ; 36 with value (4 14) 6 with value (4 25) 1 with value (4 39)
% 3.42/3.60 ; 618 with value (4 15) 2 with value (4 26) 1 with value (4 40)
% 3.42/3.60 ; 45 with value (4 16) 6 with value (4 27) 1 with value (4 43)
% 3.42/3.60 ; 1580 with value (4 17) 1 with value (4 28) 2 with value (4 45)
% 3.42/3.60 ; 28 with value (4 18) 4 with value (4 30) 1 with value (4 48)
% 3.42/3.60 ; 4643 with value (4 19)
% 3.42/3.60 Evaluation took:
% 3.42/3.60 3.127 seconds of real time
% 3.42/3.60 2.995004 seconds of user run time
% 3.42/3.60 0.13204 seconds of system run time
% 3.42/3.60 [Run times include 0.194 seconds GC run time.]
% 3.42/3.60 0 calls to %EVAL
% 3.42/3.60 0 page faults and
% 3.42/3.60 181,846,344 bytes consed.
% 3.42/3.60 :PROOF-FOUND
% 3.42/3.60 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-20T06:56:59
% 3.42/3.60 :PROOF-FOUND
% 3.42/3.60 *
%------------------------------------------------------------------------------