TSTP Solution File: NUM394+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : NUM394+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n015.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 : Mon Jul 18 14:10:13 EDT 2022
% Result : Theorem 0.20s 0.54s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 17 ( 10 unt; 2 nHn; 17 RR)
% Number of literals : 31 ( 3 equ; 15 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 10 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ ordinal(X)
| epsilon_transitive(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc1_ordinal1) ).
cnf(6,axiom,
( ~ epsilon_transitive(X)
| ~ in(Y,X)
| subset(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_ordinal1) ).
cnf(20,axiom,
( ~ ordinal(X)
| ~ ordinal(Y)
| ordinal_subset(X,Y)
| ~ subset(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
cnf(21,axiom,
( ~ ordinal(X)
| ~ ordinal(Y)
| ordinal_subset(X,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_ordinal1) ).
cnf(22,plain,
( ~ ordinal(X)
| ordinal_subset(X,X) ),
inference('CONDENSE',[status(thm)],[21]) ).
cnf(25,axiom,
( ~ ordinal(X)
| ~ ordinal(Y)
| in(X,Y)
| X = Y
| in(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t24_ordinal1) ).
cnf(26,negated_conjecture,
ordinal('SKOLEMAAAU14'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_ordinal1) ).
cnf(27,negated_conjecture,
ordinal('SKOLEMAAAU15'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_ordinal1) ).
cnf(28,negated_conjecture,
~ ordinal_subset('SKOLEMAAAU14','SKOLEMAAAU15'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_ordinal1) ).
cnf(29,negated_conjecture,
~ in('SKOLEMAAAU15','SKOLEMAAAU14'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_ordinal1) ).
cnf(38,plain,
epsilon_transitive('SKOLEMAAAU15'),
inference('HYPERRESOLVE',[status(thm)],[2,27]) ).
cnf(43,plain,
ordinal_subset('SKOLEMAAAU14','SKOLEMAAAU14'),
inference('HYPERRESOLVE',[status(thm)],[22,26]) ).
cnf(61,plain,
~ subset('SKOLEMAAAU14','SKOLEMAAAU15'),
inference('UR-RESOLVE',[status(thm)],[20,26,27,28]) ).
cnf(63,plain,
( 'SKOLEMAAAU15' = 'SKOLEMAAAU14'
| in('SKOLEMAAAU14','SKOLEMAAAU15') ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[25,27,26]),29]) ).
cnf(67,plain,
~ in('SKOLEMAAAU14','SKOLEMAAAU15'),
inference('UR-RESOLVE',[status(thm)],[6,61,38]) ).
cnf(68,plain,
'SKOLEMAAAU15' = 'SKOLEMAAAU14',
inference('REWRITE',[status(thm)],[63,67]) ).
cnf(69,plain,
$false,
inference('REWRITE',[status(thm)],[28,43,68,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM394+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.14 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jul 7 17:16:05 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.49 *
% 0.20/0.49 *
% 0.20/0.49 #<PACKAGE "SNARK-USER">
% 0.20/0.49 *
% 0.20/0.49 SNARK-TPTP-OPTIONS
% 0.20/0.49 *
% 0.20/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49 (USE-FACTORING :POS)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49 *
% 0.20/0.49 "."
% 0.20/0.49 *
% 0.20/0.49 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-07T17:16:05
% 0.20/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n015.cluster.edu at 2022-07-07T17:16:05
% 0.20/0.51 WARNING:
% 0.20/0.51 |one_to_one| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.51 WARNING:
% 0.20/0.51 |relation_empty_yielding| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.51 WARNING:
% 0.20/0.51 |relation_non_empty| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.51 WARNING:
% 0.20/0.51 |function| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.51 WARNING:
% 0.20/0.51 |relation| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.54
% 0.20/0.54
% 0.20/0.54 #||
% 0.20/0.54 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.54 % SZS output start Refutation
% See solution above
% 0.20/0.54 ||#
% 0.20/0.54
% 0.20/0.54 ; Summary of computation:
% 0.20/0.54 ; 176 formulas have been input or derived (from 51 formulas).
% 0.20/0.54 ; 69 (39%) were retained. Of these,
% 0.20/0.54 ; 17 (25%) were simplified or subsumed later,
% 0.20/0.54 ; 52 (75%) are still being kept.
% 0.20/0.54 ;
% 0.20/0.54 ; Run time in seconds excluding printing time:
% 0.20/0.54 ; 0.006 14% Read assertion file (1 call)
% 0.20/0.54 ; 0.002 5% Assert (36 calls)
% 0.20/0.54 ; 0.005 12% Process new row (151 calls)
% 0.20/0.54 ; 0.001 2% Resolution (100 calls)
% 0.20/0.54 ; 0.001 2% Paramodulation (50 calls)
% 0.20/0.54 ; 0.000 0% Factoring (1 call)
% 0.20/0.54 ; 0.001 2% Condensing (34 calls)
% 0.20/0.54 ; 0.000 0% Forward subsumption (34 calls)
% 0.20/0.54 ; 0.000 0% Backward subsumption (29 calls)
% 0.20/0.54 ; 0.001 2% Clause clause subsumption (10 calls)
% 0.20/0.54 ; 0.002 5% Forward simplification (125 calls)
% 0.20/0.54 ; 0.002 5% Backward simplification (68 calls)
% 0.20/0.54 ; 0.000 0% Ordering (37 calls)
% 0.20/0.54 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.54 ; 0.001 2% Purity testing (1 call)
% 0.20/0.54 ; 0.021 49% Other
% 0.20/0.54 ; 0.043 Total
% 0.20/0.54 ; 0.046 Real time
% 0.20/0.54 ;
% 0.20/0.54 ; Term-hash-array has 85 terms in all.
% 0.20/0.54 ; Feature-vector-row-index has 26 entries (29 at peak, 29 added, 3 deleted).
% 0.20/0.54 ; Feature-vector-row-index has 70 nodes (80 at peak, 80 added, 10 deleted).
% 0.20/0.54 ; Retrieved 7 possibly forward subsuming rows in 34 calls.
% 0.20/0.54 ; Retrieved 3 possibly backward subsumed rows in 29 calls.
% 0.20/0.54 ; Path-index has 76 entries (91 at peak, 95 added, 19 deleted).
% 0.20/0.54 ; Path-index has 110 nodes (121 at peak, 124 added, 14 deleted).
% 0.20/0.54 ; Trie-index has 76 entries (91 at peak, 95 added, 19 deleted).
% 0.20/0.54 ; Trie-index has 116 nodes (135 at peak, 139 added, 23 deleted).
% 0.20/0.54 ; Retrieved 57 generalization terms in 132 calls.
% 0.20/0.54 ; Retrieved 43 instance terms in 38 calls.
% 0.20/0.54 ; Retrieved 1,024 unifiable terms in 469 calls.
% 0.20/0.54 ;
% 0.20/0.54 ; The agenda of backward simplifiable rows to process has 9 entries:
% 0.20/0.54 ; 9 with value 0
% 0.20/0.54 ; The agenda of rows to process has 2 entries:
% 0.20/0.54 ; 1 with value 6 1 with value 8
% 0.20/0.54 ; The agenda of rows to give has 12 entries:
% 0.20/0.54 ; 1 with value (4 5) 3 with value (4 9) 1 with value (4 13)
% 0.20/0.54 ; 3 with value (4 7) 2 with value (4 10) 1 with value (4 18)
% 0.20/0.54 ; 1 with value (4 8)
% 0.20/0.54 Evaluation took:
% 0.20/0.54 0.046 seconds of real time
% 0.20/0.54 0.042689 seconds of user run time
% 0.20/0.54 0.00322 seconds of system run time
% 0.20/0.54 0 calls to %EVAL
% 0.20/0.54 0 page faults and
% 0.20/0.54 2,951,832 bytes consed.
% 0.20/0.54 :PROOF-FOUND
% 0.20/0.54 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-07T17:16:05
% 0.20/0.54 :PROOF-FOUND
% 0.20/0.54 *
%------------------------------------------------------------------------------