TSTP Solution File: LAT313+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LAT313+1 : TPTP v8.1.0. Released v3.4.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 : Sun Jul 17 06:43:51 EDT 2022
% Result : Theorem 2.05s 2.27s
% Output : Refutation 2.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 21
% Syntax : Number of clauses : 41 ( 23 unt; 11 nHn; 39 RR)
% Number of literals : 90 ( 9 equ; 42 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,negated_conjecture,
~ v3_struct_0('SKOLEMAAAU1'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t43_filter_2) ).
cnf(2,negated_conjecture,
v10_lattices('SKOLEMAAAU1'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t43_filter_2) ).
cnf(3,negated_conjecture,
l3_lattices('SKOLEMAAAU1'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t43_filter_2) ).
cnf(4,negated_conjecture,
m2_filter_2('SKOLEMAAAU2','SKOLEMAAAU1'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t43_filter_2) ).
cnf(5,negated_conjecture,
v14_lattices('SKOLEMAAAU1'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t43_filter_2) ).
cnf(6,negated_conjecture,
r2_hidden(k6_lattices('SKOLEMAAAU1'),'SKOLEMAAAU2'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t43_filter_2) ).
cnf(7,negated_conjecture,
( ~ r1_filter_2(u1_struct_0('SKOLEMAAAU1'),'SKOLEMAAAU2',k17_filter_2('SKOLEMAAAU1'))
| 'SKOLEMAAAU2' != u1_struct_0('SKOLEMAAAU1') ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t43_filter_2) ).
cnf(16,axiom,
( v3_struct_0(X)
| ~ v10_lattices(X)
| ~ l3_lattices(X)
| k17_filter_2(X) = u1_struct_0(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_filter_2) ).
cnf(18,axiom,
( v3_struct_0(X)
| ~ v10_lattices(X)
| ~ l3_lattices(X)
| v1_xboole_0(Y)
| ~ m1_subset_1(Y,k1_zfmisc_1(u1_struct_0(X)))
| m2_filter_2(k19_filter_2(X,Y),X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k19_filter_2) ).
cnf(20,axiom,
( ~ l1_lattices(X)
| l1_struct_0(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_l1_lattices) ).
cnf(22,axiom,
( ~ l3_lattices(X)
| l1_lattices(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_l3_lattices) ).
cnf(25,axiom,
( v3_struct_0(X)
| ~ v10_lattices(X)
| ~ l3_lattices(X)
| ~ m2_filter_2(Y,X)
| m2_lattice4(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_m2_filter_2) ).
cnf(26,axiom,
( v3_struct_0(X)
| ~ v10_lattices(X)
| ~ l3_lattices(X)
| ~ m2_lattice4(Y,X)
| m1_subset_1(Y,k1_zfmisc_1(u1_struct_0(X))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_m2_lattice4) ).
cnf(34,axiom,
( v3_struct_0(X)
| ~ l1_struct_0(X)
| ~ v1_xboole_0(u1_struct_0(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_struct_0) ).
cnf(49,axiom,
( v1_xboole_0(X)
| ~ m1_subset_1(Y,k1_zfmisc_1(X))
| ~ m1_subset_1(Z,k1_zfmisc_1(X))
| ~ r1_filter_2(X,Y,Z)
| Y = Z ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_r1_filter_2) ).
cnf(51,axiom,
( v1_xboole_0(X)
| ~ m1_subset_1(Y,k1_zfmisc_1(X))
| ~ m1_subset_1(Z,k1_zfmisc_1(X))
| r1_filter_2(X,Y,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_filter_2) ).
cnf(52,plain,
( v1_xboole_0(X)
| ~ m1_subset_1(Y,k1_zfmisc_1(X))
| r1_filter_2(X,Y,Y) ),
inference('CONDENSE',[status(thm)],[51]) ).
cnf(53,axiom,
r1_tarski(X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
cnf(57,axiom,
( v3_struct_0(X)
| ~ v10_lattices(X)
| ~ l3_lattices(X)
| ~ m2_filter_2(Y,X)
| r1_filter_2(u1_struct_0(X),k19_filter_2(X,Y),Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t38_filter_2) ).
cnf(59,axiom,
( m1_subset_1(X,k1_zfmisc_1(Y))
| ~ r1_tarski(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
cnf(61,axiom,
( v3_struct_0(X)
| ~ v10_lattices(X)
| ~ l3_lattices(X)
| v1_xboole_0(Y)
| ~ m1_subset_1(Y,k1_zfmisc_1(u1_struct_0(X)))
| ~ v14_lattices(X)
| ~ r2_hidden(k6_lattices(X),Y)
| k19_filter_2(X,Y) = u1_struct_0(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t42_filter_2) ).
cnf(65,axiom,
( ~ r2_hidden(X,Y)
| ~ v1_xboole_0(Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
cnf(70,plain,
l1_lattices('SKOLEMAAAU1'),
inference('HYPERRESOLVE',[status(thm)],[22,3]) ).
cnf(76,plain,
~ v1_xboole_0('SKOLEMAAAU2'),
inference('UR-RESOLVE',[status(thm)],[65,6]) ).
cnf(87,plain,
m1_subset_1(X,k1_zfmisc_1(X)),
inference('HYPERRESOLVE',[status(thm)],[59,53]) ).
cnf(118,plain,
k17_filter_2('SKOLEMAAAU1') = u1_struct_0('SKOLEMAAAU1'),
inference('UR-RESOLVE',[status(thm)],[16,1,2,3]) ).
cnf(119,plain,
( ~ r1_filter_2(k17_filter_2('SKOLEMAAAU1'),'SKOLEMAAAU2',k17_filter_2('SKOLEMAAAU1'))
| 'SKOLEMAAAU2' != k17_filter_2('SKOLEMAAAU1') ),
inference('REWRITE',[status(thm)],[7,118,theory(equality)]) ).
cnf(121,plain,
m2_lattice4('SKOLEMAAAU2','SKOLEMAAAU1'),
inference('UR-RESOLVE',[status(thm)],[25,1,2,3,4]) ).
cnf(122,plain,
r1_filter_2(k17_filter_2('SKOLEMAAAU1'),k19_filter_2('SKOLEMAAAU1','SKOLEMAAAU2'),'SKOLEMAAAU2'),
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[57,1,2,3,4]),118,theory(equality)]) ).
cnf(128,plain,
l1_struct_0('SKOLEMAAAU1'),
inference('HYPERRESOLVE',[status(thm)],[20,70]) ).
cnf(136,plain,
m1_subset_1('SKOLEMAAAU2',k1_zfmisc_1(k17_filter_2('SKOLEMAAAU1'))),
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[26,121,1,2,3]),118,theory(equality)]) ).
cnf(139,plain,
~ v1_xboole_0(k17_filter_2('SKOLEMAAAU1')),
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[34,128,1]),118,theory(equality)]) ).
cnf(163,plain,
r1_filter_2('SKOLEMAAAU2','SKOLEMAAAU2','SKOLEMAAAU2'),
inference('UR-RESOLVE',[status(thm)],[52,87,76]) ).
cnf(206,plain,
( v1_xboole_0(X)
| ~ m1_subset_1(X,k1_zfmisc_1(k17_filter_2('SKOLEMAAAU1')))
| m2_filter_2(k19_filter_2('SKOLEMAAAU1',X),'SKOLEMAAAU1') ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,118,theory(equality)]),3,2,1]) ).
cnf(207,plain,
( v1_xboole_0(X)
| ~ m1_subset_1(X,k1_zfmisc_1(k17_filter_2('SKOLEMAAAU1')))
| ~ r2_hidden(k6_lattices('SKOLEMAAAU1'),X)
| k19_filter_2('SKOLEMAAAU1',X) = k17_filter_2('SKOLEMAAAU1') ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[61,118,theory(equality)]),5,3,2,1]) ).
cnf(2256,plain,
m2_filter_2(k19_filter_2('SKOLEMAAAU1','SKOLEMAAAU2'),'SKOLEMAAAU1'),
inference('UR-RESOLVE',[status(thm)],[206,76,136]) ).
cnf(2263,plain,
m2_lattice4(k19_filter_2('SKOLEMAAAU1','SKOLEMAAAU2'),'SKOLEMAAAU1'),
inference('UR-RESOLVE',[status(thm)],[25,2256,1,2,3]) ).
cnf(2277,plain,
m1_subset_1(k19_filter_2('SKOLEMAAAU1','SKOLEMAAAU2'),k1_zfmisc_1(k17_filter_2('SKOLEMAAAU1'))),
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[26,2263,1,2,3]),118,theory(equality)]) ).
cnf(2340,plain,
k19_filter_2('SKOLEMAAAU1','SKOLEMAAAU2') = 'SKOLEMAAAU2',
inference('UR-RESOLVE',[status(thm)],[49,2277,139,136,122]) ).
cnf(9952,plain,
'SKOLEMAAAU2' = k17_filter_2('SKOLEMAAAU1'),
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[207,76,136,6]),2340,theory(equality)]) ).
cnf(9954,plain,
$false,
inference('REWRITE',[status(thm)],[119,163,9952,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LAT313+1 : TPTP v8.1.0. Released v3.4.0.
% 0.06/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 : Tue Jun 28 20:40:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 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.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-28T20:40:59
% 0.20/0.47 ; 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-28T20:40:59
% 0.20/0.49 WARNING:
% 0.20/0.49 |v1_funct_1| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 2.05/2.27
% 2.05/2.27
% 2.05/2.27 #||
% 2.05/2.27 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.05/2.27 % SZS output start Refutation
% See solution above
% 2.05/2.27 ||#
% 2.05/2.27
% 2.05/2.27 ; Summary of computation:
% 2.05/2.27 ; 22403 formulas have been input or derived (from 4030 formulas).
% 2.05/2.27 ; 9954 (44%) were retained. Of these,
% 2.05/2.27 ; 2057 (21%) were simplified or subsumed later,
% 2.05/2.27 ; 7897 (79%) are still being kept.
% 2.05/2.27 ;
% 2.05/2.27 ; Run time in seconds excluding printing time:
% 2.05/2.27 ; 0.010 1% Read assertion file (1 call)
% 2.05/2.27 ; 0.003 0% Assert (50 calls)
% 2.05/2.27 ; 0.522 29% Process new row (16,550 calls)
% 2.05/2.27 ; 0.687 38% Resolution (8,058 calls)
% 2.05/2.27 ; 0.107 6% Paramodulation (4,029 calls)
% 2.05/2.27 ; 0.002 0% Factoring (66 calls)
% 2.05/2.27 ; 0.001 0% Condensing (348 calls)
% 2.05/2.27 ; 0.012 1% Forward subsumption (348 calls)
% 2.05/2.27 ; 0.006 0% Backward subsumption (232 calls)
% 2.05/2.27 ; 0.001 0% Clause clause subsumption (636 calls)
% 2.05/2.27 ; 0.170 9% Forward simplification (16,163 calls)
% 2.05/2.27 ; 0.169 9% Backward simplification (9,953 calls)
% 2.05/2.27 ; 0.000 0% Ordering (1,418 calls)
% 2.05/2.27 ; 0.000 0% Sortal reasoning (32 calls)
% 2.05/2.27 ; 0.001 0% Purity testing (1 call)
% 2.05/2.27 ; 0.108 6% Other
% 2.05/2.27 ; 1.799 Total
% 2.05/2.27 ; 1.801 Real time
% 2.05/2.27 ;
% 2.05/2.27 ; Term-hash-array has 12,992 terms in all.
% 2.05/2.27 ; Feature-vector-row-index has 185 entries (229 at peak, 232 added, 47 deleted).
% 2.05/2.27 ; Feature-vector-row-index has 1,069 nodes (1,422 at peak, 1,455 added, 386 deleted).
% 2.05/2.27 ; Retrieved 900 possibly forward subsuming rows in 348 calls.
% 2.05/2.27 ; Retrieved 47 possibly backward subsumed rows in 232 calls.
% 2.05/2.27 ; Path-index has 10,279 entries (12,592 at peak, 13,010 added, 2,731 deleted).
% 2.05/2.27 ; Path-index has 13,721 nodes (15,102 at peak, 15,697 added, 1,976 deleted).
% 2.05/2.27 ; Trie-index has 10,279 entries (12,592 at peak, 13,010 added, 2,731 deleted).
% 2.05/2.27 ; Trie-index has 37,989 nodes (45,762 at peak, 48,182 added, 10,193 deleted).
% 2.05/2.27 ; Retrieved 20,555 generalization terms in 28,135 calls.
% 2.05/2.27 ; Retrieved 10,964 instance terms in 9,720 calls.
% 2.05/2.27 ; Retrieved 399,625 unifiable terms in 124,696 calls.
% 2.05/2.27 ;
% 2.05/2.27 ; The agenda of backward simplifiable rows to process has 1716 entries:
% 2.05/2.27 ; 1716 with value 0
% 2.05/2.27 ; The agenda of rows to process has 3 entries:
% 2.05/2.27 ; 1 with value 14 1 with value 15 1 with value 20
% 2.05/2.27 ; The agenda of rows to give has 4634 entries:
% 2.05/2.27 ; 1 with value (4 7) 70 with value (4 38) 12 with value (4 51)
% 2.05/2.27 ; 1 with value (4 9) 160 with value (4 39) 13 with value (4 52)
% 2.05/2.27 ; 637 with value (4 27) 41 with value (4 40) 10 with value (4 53)
% 2.05/2.27 ; 373 with value (4 28) 16 with value (4 41) 4 with value (4 54)
% 2.05/2.27 ; 513 with value (4 29) 16 with value (4 42) 4 with value (4 55)
% 2.05/2.27 ; 419 with value (4 30) 22 with value (4 43) 13 with value (4 56)
% 2.05/2.27 ; 489 with value (4 31) 19 with value (4 44) 6 with value (4 57)
% 2.05/2.27 ; 217 with value (4 32) 10 with value (4 45) 1 with value (4 58)
% 2.05/2.27 ; 416 with value (4 33) 9 with value (4 46) 1 with value (4 59)
% 2.05/2.27 ; 215 with value (4 34) 22 with value (4 47) 9 with value (4 60)
% 2.05/2.27 ; 374 with value (4 35) 20 with value (4 48) 3 with value (4 61)
% 2.05/2.27 ; 179 with value (4 36) 8 with value (4 49) 1 with value (4 64)
% 2.05/2.27 ; 301 with value (4 37) 7 with value (4 50) 2 with value (4 65)
% 2.05/2.27 Evaluation took:
% 2.05/2.27 1.803 seconds of real time
% 2.05/2.27 1.64985 seconds of user run time
% 2.05/2.27 0.152859 seconds of system run time
% 2.05/2.27 [Run times include 0.256 seconds GC run time.]
% 2.05/2.27 0 calls to %EVAL
% 2.05/2.27 0 page faults and
% 2.05/2.27 162,762,432 bytes consed.
% 2.05/2.27 :PROOF-FOUND
% 2.05/2.27 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-28T20:41:01
% 2.05/2.27 :PROOF-FOUND
% 2.05/2.27 *
%------------------------------------------------------------------------------