TSTP Solution File: SEU225+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SEU225+1 : TPTP v8.1.0. Released v3.3.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 : Tue Jul 19 14:20:20 EDT 2022
% Result : Theorem 3.46s 3.60s
% Output : Refutation 3.46s
% 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/sandbox/benchmark/theBenchmark.p',d4_funct_1) ).
cnf(9,axiom,
( ~ relation(X)
| relation(relation_dom_restriction(X,Y)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k7_relat_1) ).
cnf(19,axiom,
( ~ relation(X)
| ~ function(X)
| function(relation_dom_restriction(X,Y)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc4_funct_1) ).
cnf(26,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/sandbox/benchmark/theBenchmark.p',l82_funct_1) ).
cnf(46,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/sandbox/benchmark/theBenchmark.p',t68_funct_1) ).
cnf(50,negated_conjecture,
relation('SKOLEMAAAV13'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t72_funct_1) ).
cnf(51,negated_conjecture,
function('SKOLEMAAAV13'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t72_funct_1) ).
cnf(52,negated_conjecture,
in('SKOLEMAAAV12','SKOLEMAAAV11'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t72_funct_1) ).
cnf(53,negated_conjecture,
apply(relation_dom_restriction('SKOLEMAAAV13','SKOLEMAAAV11'),'SKOLEMAAAV12') != apply('SKOLEMAAAV13','SKOLEMAAAV12'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t72_funct_1) ).
cnf(69,plain,
relation(relation_dom_restriction('SKOLEMAAAV13',X)),
inference('HYPERRESOLVE',[status(thm)],[9,50]) ).
cnf(94,plain,
function(relation_dom_restriction('SKOLEMAAAV13',X)),
inference('HYPERRESOLVE',[status(thm)],[19,50,51]) ).
cnf(357,plain,
~ in('SKOLEMAAAV12',relation_dom(relation_dom_restriction('SKOLEMAAAV13','SKOLEMAAAV11'))),
inference('UR-RESOLVE',[status(thm)],[46,94,69,50,51,53,theory(equality)]) ).
cnf(7235,plain,
~ in('SKOLEMAAAV12',relation_dom('SKOLEMAAAV13')),
inference('UR-RESOLVE',[status(thm)],[26,357,50,51,52]) ).
cnf(7236,plain,
apply('SKOLEMAAAV13','SKOLEMAAAV12') != empty_set,
inference('UR-RESOLVE',[status(thm)],[7,357,69,94,53]) ).
cnf(7247,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[7,7235,50,51,theory(equality)]),7236]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEU225+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.15 % Command : run-snark %s %d
% 0.15/0.36 % Computer : n009.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jun 20 03:46:22 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.23/0.49 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.23/0.50 *
% 0.23/0.51 *
% 0.23/0.51 #<PACKAGE "SNARK-USER">
% 0.23/0.51 *
% 0.23/0.51 SNARK-TPTP-OPTIONS
% 0.23/0.51 *
% 0.23/0.51 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.23/0.51 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.23/0.51 (USE-FACTORING :POS)
% 0.23/0.51 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.23/0.51 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.23/0.51 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.23/0.51 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.23/0.51 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.23/0.51 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.23/0.51 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.23/0.51 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.23/0.51 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.23/0.51 (DECLARE-TPTP-SYMBOLS2))
% 0.23/0.51 *
% 0.23/0.51 "."
% 0.23/0.51 *
% 0.23/0.51 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-20T03:46:23
% 0.23/0.51 ; 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-06-20T03:46:23
% 0.23/0.53
% 0.23/0.53 ; Recognized commutativity assertion (= (|unordered_pair| ?X ?Y) (|unordered_pair| ?Y ?X)).
% 0.23/0.53 ; Recognized commutativity assertion (= (|set_intersection2| ?X ?Y) (|set_intersection2| ?Y ?X)).
% 0.23/0.53 ; Declaring unordered_pair to be commutative.
% 0.23/0.53 WARNING:
% 0.23/0.53 |one_to_one| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 3.46/3.60 ; Declaring set_intersection2 to be commutative.
% 3.46/3.60
% 3.46/3.60 #||
% 3.46/3.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.46/3.60 % SZS output start Refutation
% See solution above
% 3.46/3.61 ||#
% 3.46/3.61
% 3.46/3.61 ; Summary of computation:
% 3.46/3.61 ; 29073 formulas have been input or derived (from 210 formulas).
% 3.46/3.61 ; 7247 (25%) were retained. Of these,
% 3.46/3.61 ; 23 ( 0%) were simplified or subsumed later,
% 3.46/3.61 ; 7224 (100%) are still being kept.
% 3.46/3.61 ;
% 3.46/3.61 ; Run time in seconds excluding printing time:
% 3.46/3.61 ; 0.008 0% Read assertion file (1 call)
% 3.46/3.61 ; 0.003 0% Assert (47 calls)
% 3.46/3.61 ; 0.553 18% Process new row (28,987 calls)
% 3.46/3.61 ; 1.766 57% Resolution (418 calls)
% 3.46/3.61 ; 0.006 0% Paramodulation (209 calls)
% 3.46/3.61 ; 0.000 0% Factoring (1 call)
% 3.46/3.61 ; 0.001 0% Condensing (180 calls)
% 3.46/3.61 ; 0.005 0% Forward subsumption (180 calls)
% 3.46/3.61 ; 0.000 0% Backward subsumption (79 calls)
% 3.46/3.61 ; 0.002 0% Clause clause subsumption (138 calls)
% 3.46/3.61 ; 0.256 8% Forward simplification (28,974 calls)
% 3.46/3.61 ; 0.378 12% Backward simplification (7,247 calls)
% 3.46/3.61 ; 0.000 0% Ordering (477 calls)
% 3.46/3.61 ; 0.000 0% Sortal reasoning (32 calls)
% 3.46/3.61 ; 0.000 0% Purity testing (1 call)
% 3.46/3.61 ; 0.107 3% Other
% 3.46/3.61 ; 3.085 Total
% 3.46/3.61 ; 3.096 Real time
% 3.46/3.61 ;
% 3.46/3.61 ; Term-hash-array has 14,655 terms in all.
% 3.46/3.61 ; Feature-vector-row-index has 74 entries (74 at peak, 79 added, 5 deleted).
% 3.46/3.61 ; Feature-vector-row-index has 542 nodes (542 at peak, 584 added, 42 deleted).
% 3.46/3.61 ; Retrieved 137 possibly forward subsuming rows in 180 calls.
% 3.46/3.61 ; Retrieved 1 possibly backward subsumed row in 79 calls.
% 3.46/3.61 ; Path-index has 14,635 entries (14,635 at peak, 14,669 added, 34 deleted).
% 3.46/3.61 ; Path-index has 974 nodes (974 at peak, 1,007 added, 33 deleted).
% 3.46/3.61 ; Trie-index has 14,635 entries (14,635 at peak, 14,669 added, 34 deleted).
% 3.46/3.61 ; Trie-index has 24,850 nodes (24,850 at peak, 24,916 added, 66 deleted).
% 3.46/3.61 ; Retrieved 48,182 generalization terms in 65,038 calls.
% 3.46/3.61 ; Retrieved 32,316 instance terms in 7,167 calls.
% 3.46/3.61 ; Retrieved 4,875,587 unifiable terms in 165,827 calls.
% 3.46/3.61 ;
% 3.46/3.61 ; The agenda of rows to process has 20 entries:
% 3.46/3.61 ; 4 with value 11 4 with value 15 4 with value 17
% 3.46/3.61 ; 1 with value 12 1 with value 16 1 with value 20
% 3.46/3.61 ; 5 with value 13
% 3.46/3.61 ; The agenda of rows to give has 7022 entries:
% 3.46/3.61 ; 1 with value (4 10) 3 with value (4 20) 4 with value (4 32)
% 3.46/3.61 ; 6 with value (4 11) 13 with value (4 21) 2 with value (4 34)
% 3.46/3.61 ; 5 with value (4 12) 3 with value (4 22) 3 with value (4 35)
% 3.46/3.61 ; 134 with value (4 13) 3 with value (4 23) 1 with value (4 37)
% 3.46/3.61 ; 19 with value (4 14) 1 with value (4 25) 1 with value (4 39)
% 3.46/3.61 ; 591 with value (4 15) 2 with value (4 26) 1 with value (4 40)
% 3.46/3.61 ; 8 with value (4 16) 6 with value (4 27) 1 with value (4 43)
% 3.46/3.61 ; 1561 with value (4 17) 1 with value (4 28) 1 with value (4 45)
% 3.46/3.61 ; 5 with value (4 18) 4 with value (4 30) 1 with value (4 48)
% 3.46/3.61 ; 4641 with value (4 19)
% 3.46/3.61 Evaluation took:
% 3.46/3.61 3.097 seconds of real time
% 3.46/3.61 2.953059 seconds of user run time
% 3.46/3.61 0.144006 seconds of system run time
% 3.46/3.61 [Run times include 0.187 seconds GC run time.]
% 3.46/3.61 0 calls to %EVAL
% 3.46/3.61 0 page faults and
% 3.46/3.61 177,349,728 bytes consed.
% 3.46/3.61 :PROOF-FOUND
% 3.46/3.61 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-20T03:46:26
% 3.46/3.61 :PROOF-FOUND
% 3.46/3.61 *
%------------------------------------------------------------------------------