TSTP Solution File: SEU110+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SEU110+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n018.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:19:10 EDT 2022
% Result : Theorem 1.07s 1.24s
% Output : Refutation 1.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 15 ( 9 unt; 1 nHn; 13 RR)
% Number of literals : 29 ( 3 equ; 16 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 17 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(9,axiom,
( subset(X,Y)
| in('SKOLEMAAAV1'(X,Y),X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
cnf(10,axiom,
( subset(X,Y)
| ~ in('SKOLEMAAAV1'(X,Y),Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
cnf(11,axiom,
( ~ preboolean(X)
| X != finite_subsets(Y)
| ~ in(Z,X)
| subset(Z,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_finsub_1) ).
cnf(12,axiom,
( ~ preboolean(X)
| X != finite_subsets(Y)
| ~ in(Z,X)
| finite(Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_finsub_1) ).
cnf(13,axiom,
( ~ preboolean(X)
| X != finite_subsets(Y)
| in(Z,X)
| ~ subset(Z,Y)
| ~ finite(Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_finsub_1) ).
cnf(17,axiom,
preboolean(finite_subsets(X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k5_finsub_1) ).
cnf(50,axiom,
( ~ subset(X,Y)
| ~ subset(Y,Z)
| subset(X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
cnf(51,negated_conjecture,
subset('SKOLEMAAAV13','SKOLEMAAAV14'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_finsub_1) ).
cnf(52,negated_conjecture,
~ subset(finite_subsets('SKOLEMAAAV13'),finite_subsets('SKOLEMAAAV14')),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_finsub_1) ).
cnf(118,plain,
in('SKOLEMAAAV1'(finite_subsets('SKOLEMAAAV13'),finite_subsets('SKOLEMAAAV14')),finite_subsets('SKOLEMAAAV13')),
inference('HYPERRESOLVE',[status(thm)],[52,9]) ).
cnf(120,plain,
~ in('SKOLEMAAAV1'(finite_subsets('SKOLEMAAAV13'),finite_subsets('SKOLEMAAAV14')),finite_subsets('SKOLEMAAAV14')),
inference('UR-RESOLVE',[status(thm)],[10,52]) ).
cnf(3065,plain,
finite('SKOLEMAAAV1'(finite_subsets('SKOLEMAAAV13'),finite_subsets('SKOLEMAAAV14'))),
inference('HYPERRESOLVE',[status(thm)],[12,118,17,theory(equality)]) ).
cnf(3066,plain,
subset('SKOLEMAAAV1'(finite_subsets('SKOLEMAAAV13'),finite_subsets('SKOLEMAAAV14')),'SKOLEMAAAV13'),
inference('HYPERRESOLVE',[status(thm)],[11,118,17,theory(equality)]) ).
cnf(3075,plain,
~ subset('SKOLEMAAAV1'(finite_subsets('SKOLEMAAAV13'),finite_subsets('SKOLEMAAAV14')),'SKOLEMAAAV14'),
inference('UR-RESOLVE',[status(thm)],[13,120,17,3065,theory(equality)]) ).
cnf(5767,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[50,3066,51]),3075]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU110+1 : TPTP v8.1.0. Released v3.2.0.
% 0.13/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n018.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 20:44:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 0.20/0.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-19T20:44:19
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2022-06-19T20:44:19
% 0.20/0.49 WARNING:
% 0.20/0.49 |cap_closed| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.49 WARNING:
% 0.20/0.49 |relation| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.49 WARNING:
% 0.20/0.49 |function| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.49 WARNING:
% 0.20/0.49 |one_to_one| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.49 WARNING:
% 0.20/0.49 |epsilon_transitive| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.49 WARNING:
% 0.20/0.49 |epsilon_connected| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.49 WARNING:
% 0.20/0.49 |ordinal| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.49 WARNING:
% 0.20/0.49 |natural| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 1.07/1.24
% 1.07/1.24
% 1.07/1.24 #||
% 1.07/1.24 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.07/1.24 % SZS output start Refutation
% See solution above
% 1.07/1.24 ||#
% 1.07/1.24
% 1.07/1.24 ; Summary of computation:
% 1.07/1.24 ; 11714 formulas have been input or derived (from 822 formulas).
% 1.07/1.24 ; 5767 (49%) were retained. Of these,
% 1.07/1.24 ; 75 ( 1%) were simplified or subsumed later,
% 1.07/1.24 ; 5692 (99%) are still being kept.
% 1.07/1.24 ;
% 1.07/1.24 ; Run time in seconds excluding printing time:
% 1.07/1.24 ; 0.007 1% Read assertion file (1 call)
% 1.07/1.24 ; 0.002 0% Assert (34 calls)
% 1.07/1.24 ; 0.315 41% Process new row (9,956 calls)
% 1.07/1.24 ; 0.174 23% Resolution (1,642 calls)
% 1.07/1.24 ; 0.012 2% Paramodulation (821 calls)
% 1.07/1.24 ; 0.001 0% Factoring (22 calls)
% 1.07/1.24 ; 0.003 0% Condensing (1,022 calls)
% 1.07/1.24 ; 0.050 7% Forward subsumption (1,022 calls)
% 1.07/1.24 ; 0.016 2% Backward subsumption (943 calls)
% 1.07/1.24 ; 0.003 0% Clause clause subsumption (1,604 calls)
% 1.07/1.24 ; 0.071 9% Forward simplification (9,897 calls)
% 1.07/1.24 ; 0.034 4% Backward simplification (5,767 calls)
% 1.07/1.24 ; 0.001 0% Ordering (1,065 calls)
% 1.07/1.24 ; 0.000 0% Sortal reasoning (32 calls)
% 1.07/1.24 ; 0.001 0% Purity testing (1 call)
% 1.07/1.24 ; 0.073 10% Other
% 1.07/1.24 ; 0.763 Total
% 1.07/1.24 ; 0.764 Real time
% 1.07/1.24 ;
% 1.07/1.24 ; Term-hash-array has 7,891 terms in all.
% 1.07/1.24 ; Feature-vector-row-index has 938 entries (938 at peak, 943 added, 5 deleted).
% 1.07/1.24 ; Feature-vector-row-index has 4,587 nodes (4,587 at peak, 4,625 added, 38 deleted).
% 1.07/1.24 ; Retrieved 1,965 possibly forward subsuming rows in 1,022 calls.
% 1.07/1.24 ; Retrieved 107 possibly backward subsumed rows in 943 calls.
% 1.07/1.24 ; Path-index has 7,807 entries (7,807 at peak, 7,899 added, 92 deleted).
% 1.07/1.24 ; Path-index has 8,824 nodes (8,824 at peak, 8,879 added, 55 deleted).
% 1.07/1.24 ; Trie-index has 7,807 entries (7,807 at peak, 7,899 added, 92 deleted).
% 1.07/1.24 ; Trie-index has 22,008 nodes (22,008 at peak, 22,231 added, 223 deleted).
% 1.07/1.24 ; Retrieved 8,423 generalization terms in 13,449 calls.
% 1.07/1.24 ; Retrieved 4,879 instance terms in 4,823 calls.
% 1.07/1.24 ; Retrieved 141,843 unifiable terms in 20,363 calls.
% 1.07/1.24 ;
% 1.07/1.24 ; The agenda of rows to process has 24 entries:
% 1.07/1.24 ; 3 with value 13 2 with value 15 5 with value 20
% 1.07/1.24 ; 4 with value 14 6 with value 17 4 with value 24
% 1.07/1.24 ; The agenda of rows to give has 4885 entries:
% 1.07/1.24 ; 1 with value (4 10) 143 with value (4 18) 86 with value (4 24)
% 1.07/1.24 ; 325 with value (4 13) 832 with value (4 19) 50 with value (4 25)
% 1.07/1.24 ; 685 with value (4 14) 745 with value (4 20) 2 with value (4 26)
% 1.07/1.24 ; 834 with value (4 15) 101 with value (4 21) 2 with value (4 27)
% 1.07/1.24 ; 564 with value (4 16) 22 with value (4 22) 46 with value (4 30)
% 1.07/1.24 ; 280 with value (4 17) 8 with value (4 23) 159 with value (4 31)
% 1.07/1.24 Evaluation took:
% 1.07/1.24 0.766 seconds of real time
% 1.07/1.24 0.707516 seconds of user run time
% 1.07/1.24 0.057726 seconds of system run time
% 1.07/1.24 [Run times include 0.067 seconds GC run time.]
% 1.07/1.24 0 calls to %EVAL
% 1.07/1.24 0 page faults and
% 1.07/1.24 59,487,240 bytes consed.
% 1.07/1.24 :PROOF-FOUND
% 1.07/1.24 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-19T20:44:20
% 1.07/1.24 :PROOF-FOUND
% 1.07/1.24 *
%------------------------------------------------------------------------------