%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SEU268+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n027.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:47 EDT 2022
% Result : Theorem 0.39s 0.57s
% Output : Refutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 14 ( 9 unt; 1 nHn; 10 RR)
% Number of literals : 27 ( 4 equ; 16 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 14 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(9,axiom,
( ~ relation(X)
| is_reflexive_in(X,Y)
| in('SKOLEMAAAW1'(Y,X),Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_relat_2) ).
cnf(10,axiom,
( ~ relation(X)
| is_reflexive_in(X,Y)
| ~ in(ordered_pair('SKOLEMAAAW1'(Y,X),'SKOLEMAAAW1'(Y,X)),X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_relat_2) ).
cnf(11,axiom,
( ~ relation(X)
| X != inclusion_relation(Y)
| relation_field(X) = Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_wellord2) ).
cnf(13,axiom,
( ~ relation(X)
| X != inclusion_relation(Y)
| ~ in(Z,Y)
| ~ in(U,Y)
| in(ordered_pair(Z,U),X)
| ~ subset(Z,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_wellord2) ).
cnf(21,axiom,
( ~ relation(X)
| reflexive(X)
| ~ is_reflexive_in(X,relation_field(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_relat_2) ).
cnf(22,axiom,
relation(inclusion_relation(X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_wellord2) ).
cnf(51,axiom,
subset(X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
cnf(55,negated_conjecture,
~ reflexive(inclusion_relation('SKOLEMAAAW14')),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_wellord2) ).
cnf(82,plain,
~ is_reflexive_in(inclusion_relation('SKOLEMAAAW14'),relation_field(inclusion_relation('SKOLEMAAAW14'))),
inference('UR-RESOLVE',[status(thm)],[21,22,55]) ).
cnf(96,plain,
relation_field(inclusion_relation(X)) = X,
inference('HYPERRESOLVE',[status(thm)],[11,22,theory(equality)]) ).
cnf(98,plain,
~ is_reflexive_in(inclusion_relation('SKOLEMAAAW14'),'SKOLEMAAAW14'),
inference('REWRITE',[status(thm)],[82,96,theory(equality)]) ).
cnf(133,plain,
in('SKOLEMAAAW1'('SKOLEMAAAW14',inclusion_relation('SKOLEMAAAW14')),'SKOLEMAAAW14'),
inference('UR-RESOLVE',[status(thm)],[9,98,22]) ).
cnf(134,plain,
~ in(ordered_pair('SKOLEMAAAW1'('SKOLEMAAAW14',inclusion_relation('SKOLEMAAAW14')),'SKOLEMAAAW1'('SKOLEMAAAW14',inclusion_relation('SKOLEMAAAW14'))),inclusion_relation('SKOLEMAAAW14')),
inference('UR-RESOLVE',[status(thm)],[10,98,22]) ).
cnf(182,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[13,133,22,133,51,theory(equality)]),134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU268+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n027.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 : Sun Jun 19 04:50:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 0.19/0.48 #<PACKAGE "SNARK-USER">
% 0.19/0.48 *
% 0.19/0.48 SNARK-TPTP-OPTIONS
% 0.19/0.48 *
% 0.19/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48 (USE-FACTORING :POS)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48 *
% 0.19/0.48 "."
% 0.19/0.48 *
% 0.19/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-19T04:50:38
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n027.cluster.edu at 2022-06-19T04:50:38
% 0.19/0.50
% 0.19/0.50 ; Recognized commutativity assertion (= (|unordered_pair| ?X ?Y) (|unordered_pair| ?Y ?X)).
% 0.19/0.50 ; Recognized commutativity assertion (= (|set_union2| ?X ?Y) (|set_union2| ?Y ?X)).
% 0.19/0.50 ; Recognized right identity assertion (= (|set_union2| ?X |empty_set|) ?X).
% 0.19/0.50 ; Declaring unordered_pair to be commutative.
% 0.19/0.50 WARNING:
% 0.19/0.50 |one_to_one| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.19/0.50 WARNING:
% 0.19/0.50 |relation_empty_yielding| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.19/0.50 WARNING:
% 0.19/0.50 |function| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.39/0.57 ; Declaring set_union2 to be commutative.
% 0.39/0.57
% 0.39/0.57 #||
% 0.39/0.57 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.57 % SZS output start Refutation
% See solution above
% 0.39/0.57 ||#
% 0.39/0.57
% 0.39/0.57 ; Summary of computation:
% 0.39/0.57 ; 480 formulas have been input or derived (from 103 formulas).
% 0.39/0.57 ; 182 (38%) were retained. Of these,
% 0.39/0.57 ; 26 (14%) were simplified or subsumed later,
% 0.39/0.57 ; 156 (86%) are still being kept.
% 0.39/0.57 ;
% 0.39/0.57 ; Run time in seconds excluding printing time:
% 0.39/0.57 ; 0.008 9% Read assertion file (1 call)
% 0.39/0.57 ; 0.002 2% Assert (51 calls)
% 0.39/0.57 ; 0.014 16% Process new row (397 calls)
% 0.39/0.57 ; 0.018 20% Resolution (204 calls)
% 0.39/0.57 ; 0.000 0% Paramodulation (102 calls)
% 0.39/0.57 ; 0.000 0% Factoring (1 call)
% 0.39/0.57 ; 0.001 1% Condensing (94 calls)
% 0.39/0.57 ; 0.004 4% Forward subsumption (94 calls)
% 0.39/0.57 ; 0.001 1% Backward subsumption (56 calls)
% 0.39/0.57 ; 0.000 0% Clause clause subsumption (46 calls)
% 0.39/0.57 ; 0.008 9% Forward simplification (376 calls)
% 0.39/0.57 ; 0.003 3% Backward simplification (182 calls)
% 0.39/0.57 ; 0.000 0% Ordering (118 calls)
% 0.39/0.57 ; 0.001 1% Sortal reasoning (32 calls)
% 0.39/0.57 ; 0.000 0% Purity testing (1 call)
% 0.39/0.57 ; 0.030 33% Other
% 0.39/0.57 ; 0.090 Total
% 0.39/0.57 ; 0.091 Real time
% 0.39/0.57 ;
% 0.39/0.57 ; Term-hash-array has 313 terms in all.
% 0.39/0.57 ; Feature-vector-row-index has 56 entries (56 at peak, 56 added, 0 deleted).
% 0.39/0.57 ; Feature-vector-row-index has 261 nodes (261 at peak, 261 added, 0 deleted).
% 0.39/0.57 ; Retrieved 66 possibly forward subsuming rows in 94 calls.
% 0.39/0.57 ; Retrieved 6 possibly backward subsumed rows in 56 calls.
% 0.39/0.57 ; Path-index has 297 entries (297 at peak, 327 added, 30 deleted).
% 0.39/0.57 ; Path-index has 707 nodes (707 at peak, 736 added, 29 deleted).
% 0.39/0.57 ; Trie-index has 297 entries (297 at peak, 327 added, 30 deleted).
% 0.39/0.57 ; Trie-index has 848 nodes (848 at peak, 913 added, 65 deleted).
% 0.39/0.57 ; Retrieved 416 generalization terms in 837 calls.
% 0.39/0.57 ; Retrieved 132 instance terms in 125 calls.
% 0.39/0.57 ; Retrieved 13,237 unifiable terms in 2,336 calls.
% 0.39/0.57 ;
% 0.39/0.57 ; The agenda of rows to give has 63 entries:
% 0.39/0.57 ; 1 with value (4 6) 2 with value (4 14) 1 with value (4 20)
% 0.39/0.57 ; 1 with value (4 7) 2 with value (4 15) 1 with value (4 21)
% 0.39/0.57 ; 2 with value (4 9) 2 with value (4 16) 2 with value (4 22)
% 0.39/0.57 ; 5 with value (4 11) 2 with value (4 17) 3 with value (4 36)
% 0.39/0.57 ; 13 with value (4 12) 2 with value (4 18) 2 with value (4 41)
% 0.39/0.57 ; 10 with value (4 13) 12 with value (4 19)
% 0.39/0.57 Evaluation took:
% 0.39/0.57 0.092 seconds of real time
% 0.39/0.57 0.077567 seconds of user run time
% 0.39/0.57 0.014325 seconds of system run time
% 0.39/0.57 0 calls to %EVAL
% 0.39/0.57 0 page faults and
% 0.39/0.57 5,192,136 bytes consed.
% 0.39/0.57 :PROOF-FOUND
% 0.39/0.57 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-19T04:50:39
% 0.39/0.57 :PROOF-FOUND
% 0.39/0.57 *
%------------------------------------------------------------------------------