TSTP Solution File: NUM390+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : NUM390+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n020.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:11 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of clauses : 18 ( 12 unt; 1 nHn; 18 RR)
% Number of literals : 29 ( 2 equ; 14 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( ~ ordinal(X)
| epsilon_transitive(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_ordinal1) ).
cnf(6,axiom,
( ~ epsilon_transitive(X)
| ~ in(Y,X)
| subset(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_ordinal1) ).
cnf(11,axiom,
( proper_subset(X,Y)
| ~ subset(X,Y)
| X = Y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_xboole_0) ).
cnf(25,axiom,
( ~ subset(X,Y)
| ~ subset(Y,Z)
| subset(X,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
cnf(26,axiom,
( ~ epsilon_transitive(X)
| ~ ordinal(Y)
| ~ proper_subset(X,Y)
| in(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t21_ordinal1) ).
cnf(27,negated_conjecture,
epsilon_transitive('SKOLEMAAAV14'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t22_ordinal1) ).
cnf(29,negated_conjecture,
ordinal('SKOLEMAAAV16'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t22_ordinal1) ).
cnf(30,negated_conjecture,
subset('SKOLEMAAAV14','SKOLEMAAAV15'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t22_ordinal1) ).
cnf(31,negated_conjecture,
in('SKOLEMAAAV15','SKOLEMAAAV16'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t22_ordinal1) ).
cnf(32,negated_conjecture,
~ in('SKOLEMAAAV14','SKOLEMAAAV16'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t22_ordinal1) ).
cnf(40,axiom,
( ~ in(X,Y)
| ~ subset(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_ordinal1) ).
cnf(42,plain,
epsilon_transitive('SKOLEMAAAV16'),
inference('HYPERRESOLVE',[status(thm)],[3,29]) ).
cnf(53,plain,
~ in('SKOLEMAAAV15','SKOLEMAAAV14'),
inference('UR-RESOLVE',[status(thm)],[40,30]) ).
cnf(68,plain,
~ proper_subset('SKOLEMAAAV14','SKOLEMAAAV16'),
inference('UR-RESOLVE',[status(thm)],[26,27,29,32]) ).
cnf(70,plain,
subset('SKOLEMAAAV15','SKOLEMAAAV16'),
inference('HYPERRESOLVE',[status(thm)],[6,42,31]) ).
cnf(79,plain,
subset('SKOLEMAAAV14','SKOLEMAAAV16'),
inference('HYPERRESOLVE',[status(thm)],[25,70,30]) ).
cnf(101,plain,
'SKOLEMAAAV14' = 'SKOLEMAAAV16',
inference('UR-RESOLVE',[status(thm)],[11,79,68]) ).
cnf(103,plain,
$false,
inference('REWRITE',[status(thm)],[31,53,101,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM390+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n020.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 : Wed Jul 6 07:12:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-06T07:12:29
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-07-06T07:12:29
% 0.20/0.50 WARNING:
% 0.20/0.50 |one_to_one| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.50 WARNING:
% 0.20/0.50 |relation_empty_yielding| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.50 WARNING:
% 0.20/0.50 |relation_non_empty| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.50 WARNING:
% 0.20/0.50 |function| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.50 WARNING:
% 0.20/0.50 |relation| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53 #||
% 0.20/0.53 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.53 % SZS output start Refutation
% See solution above
% 0.20/0.53 ||#
% 0.20/0.53
% 0.20/0.53 ; Summary of computation:
% 0.20/0.53 ; 276 formulas have been input or derived (from 72 formulas).
% 0.20/0.53 ; 103 (37%) were retained. Of these,
% 0.20/0.53 ; 33 (32%) were simplified or subsumed later,
% 0.20/0.53 ; 70 (68%) are still being kept.
% 0.20/0.53 ;
% 0.20/0.53 ; Run time in seconds excluding printing time:
% 0.20/0.53 ; 0.006 12% Read assertion file (1 call)
% 0.20/0.53 ; 0.002 4% Assert (38 calls)
% 0.20/0.53 ; 0.005 10% Process new row (218 calls)
% 0.20/0.53 ; 0.005 10% Resolution (142 calls)
% 0.20/0.53 ; 0.000 0% Paramodulation (71 calls)
% 0.20/0.53 ; 0.000 0% Factoring (1 call)
% 0.20/0.53 ; 0.000 0% Condensing (31 calls)
% 0.20/0.53 ; 0.000 0% Forward subsumption (31 calls)
% 0.20/0.53 ; 0.001 2% Backward subsumption (30 calls)
% 0.20/0.53 ; 0.000 0% Clause clause subsumption (5 calls)
% 0.20/0.53 ; 0.003 6% Forward simplification (192 calls)
% 0.20/0.53 ; 0.002 4% Backward simplification (103 calls)
% 0.20/0.53 ; 0.000 0% Ordering (28 calls)
% 0.20/0.53 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.53 ; 0.001 2% Purity testing (1 call)
% 0.20/0.53 ; 0.024 49% Other
% 0.20/0.53 ; 0.049 Total
% 0.20/0.53 ; 0.051 Real time
% 0.20/0.53 ;
% 0.20/0.53 ; Term-hash-array has 129 terms in all.
% 0.20/0.53 ; Feature-vector-row-index has 29 entries (30 at peak, 30 added, 1 deleted).
% 0.20/0.53 ; Feature-vector-row-index has 73 nodes (77 at peak, 77 added, 4 deleted).
% 0.20/0.53 ; Retrieved 3 possibly forward subsuming rows in 31 calls.
% 0.20/0.53 ; Retrieved 2 possibly backward subsumed rows in 30 calls.
% 0.20/0.53 ; Path-index has 99 entries (135 at peak, 139 added, 40 deleted).
% 0.20/0.53 ; Path-index has 144 nodes (175 at peak, 179 added, 35 deleted).
% 0.20/0.53 ; Trie-index has 99 entries (135 at peak, 139 added, 40 deleted).
% 0.20/0.53 ; Trie-index has 154 nodes (209 at peak, 213 added, 59 deleted).
% 0.20/0.53 ; Retrieved 132 generalization terms in 190 calls.
% 0.20/0.53 ; Retrieved 88 instance terms in 72 calls.
% 0.20/0.53 ; Retrieved 1,554 unifiable terms in 652 calls.
% 0.20/0.53 ;
% 0.20/0.53 ; The agenda of backward simplifiable rows to process has 27 entries:
% 0.20/0.53 ; 27 with value 0
% 0.20/0.53 ; The agenda of rows to process has 3 entries:
% 0.20/0.53 ; 1 with value 8 1 with value 10 1 with value 12
% 0.20/0.53 ; The agenda of input rows to give has 1 entry:
% 0.20/0.53 ; 1 with value 3
% 0.20/0.53 ; The agenda of rows to give has 18 entries:
% 0.20/0.53 ; 8 with value (4 8) 2 with value (4 10) 2 with value (4 13)
% 0.20/0.53 ; 3 with value (4 9) 2 with value (4 11) 1 with value (4 18)
% 0.20/0.53 Evaluation took:
% 0.20/0.53 0.052 seconds of real time
% 0.20/0.53 0.043544 seconds of user run time
% 0.20/0.53 0.008104 seconds of system run time
% 0.20/0.53 0 calls to %EVAL
% 0.20/0.53 0 page faults and
% 0.20/0.53 3,172,760 bytes consed.
% 0.20/0.53 :PROOF-FOUND
% 0.20/0.53 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-06T07:12:29
% 0.20/0.53 :PROOF-FOUND
% 0.20/0.53 *
%------------------------------------------------------------------------------