TSTP Solution File: SET857-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SET857-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n010.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 05:12:54 EDT 2022
% Result : Unsatisfiable 1.07s 1.27s
% Output : Refutation 1.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 35 ( 18 unt; 15 nHn; 32 RR)
% Number of literals : 73 ( 12 equ; 23 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 33 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OsubsetD_0,axiom,
( ~ c_in(X,Y,Z)
| ~ c_lessequals(Y,U,tc_set(Z))
| c_in(X,U,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetD_0) ).
cnf(cls_Set_OsubsetI_0,axiom,
( c_in(c_Main_OsubsetI__1(X,Y,Z),X,Z)
| c_lessequals(X,Y,tc_set(Z)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).
cnf(cls_Set_OsubsetI_1,axiom,
( ~ c_in(c_Main_OsubsetI__1(X,Y,Z),Y,Z)
| c_lessequals(X,Y,tc_set(Z)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_1) ).
cnf(cls_Zorn_OAbrial__axiom1_0,axiom,
c_lessequals(X,c_Zorn_Osucc(Y,X,Z),tc_set(tc_set(Z))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OAbrial__axiom1_0) ).
cnf(cls_Zorn_OTFin__linear__lemma1_0,axiom,
( ~ c_in(X,c_Zorn_OTFin(Y,Z),tc_set(tc_set(Z)))
| ~ c_in(U,c_Zorn_OTFin(Y,Z),tc_set(tc_set(Z)))
| c_in(c_Zorn_OTFin__linear__lemma1__1(Y,X,Z),c_Zorn_OTFin(Y,Z),tc_set(tc_set(Z)))
| c_lessequals(U,X,tc_set(tc_set(Z)))
| c_lessequals(c_Zorn_Osucc(Y,X,Z),U,tc_set(tc_set(Z))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_0) ).
cnf(cls_Zorn_OTFin__linear__lemma1_1,axiom,
( ~ c_in(X,c_Zorn_OTFin(Y,Z),tc_set(tc_set(Z)))
| ~ c_in(U,c_Zorn_OTFin(Y,Z),tc_set(tc_set(Z)))
| c_lessequals(U,X,tc_set(tc_set(Z)))
| c_lessequals(c_Zorn_OTFin__linear__lemma1__1(Y,X,Z),X,tc_set(tc_set(Z)))
| c_lessequals(c_Zorn_Osucc(Y,X,Z),U,tc_set(tc_set(Z))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_1) ).
cnf(cls_Zorn_OTFin__linear__lemma1_2,axiom,
( ~ c_in(X,c_Zorn_OTFin(Y,Z),tc_set(tc_set(Z)))
| ~ c_in(U,c_Zorn_OTFin(Y,Z),tc_set(tc_set(Z)))
| c_Zorn_OTFin__linear__lemma1__1(Y,X,Z) != X
| c_lessequals(U,X,tc_set(tc_set(Z)))
| c_lessequals(c_Zorn_Osucc(Y,X,Z),U,tc_set(tc_set(Z))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_2) ).
cnf(cls_Zorn_OTFin__linear__lemma1_3,axiom,
( ~ c_in(X,c_Zorn_OTFin(Y,Z),tc_set(tc_set(Z)))
| ~ c_in(U,c_Zorn_OTFin(Y,Z),tc_set(tc_set(Z)))
| ~ c_lessequals(c_Zorn_Osucc(Y,c_Zorn_OTFin__linear__lemma1__1(Y,X,Z),Z),X,tc_set(tc_set(Z)))
| c_lessequals(U,X,tc_set(tc_set(Z)))
| c_lessequals(c_Zorn_Osucc(Y,X,Z),U,tc_set(tc_set(Z))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_3) ).
cnf(cls_conjecture_0,negated_conjecture,
c_lessequals(v_Y,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(tc_set(t_a)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_n,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_3,negated_conjecture,
c_in(v_x,v_Y,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_4,negated_conjecture,
~ c_lessequals(v_x,v_n,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_5,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),v_x,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(cls_conjecture_6,negated_conjecture,
( c_lessequals(c_Zorn_Osucc(v_S,X,t_a),Y,tc_set(tc_set(t_a)))
| X = Y
| ~ c_lessequals(X,Y,tc_set(tc_set(t_a)))
| ~ c_in(X,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_in(Y,v_Y,tc_set(tc_set(t_a))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6) ).
cnf(15,plain,
c_in(c_Main_OsubsetI__1(v_x,v_n,tc_set(t_a)),v_x,tc_set(t_a)),
inference('HYPERRESOLVE',[status(thm)],[cls_conjecture_4,cls_Set_OsubsetI_0]) ).
cnf(17,plain,
~ c_in(c_Main_OsubsetI__1(v_x,v_n,tc_set(t_a)),v_n,tc_set(t_a)),
inference('UR-RESOLVE',[status(thm)],[cls_Set_OsubsetI_1,cls_conjecture_4]) ).
cnf(19,plain,
c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference('HYPERRESOLVE',[status(thm)],[cls_Set_OsubsetD_0,cls_conjecture_3,cls_conjecture_0]) ).
cnf(28,plain,
c_Zorn_OTFin__linear__lemma1__1(v_S,v_n,t_a) != v_n,
inference('UR-RESOLVE',[status(thm)],[cls_Zorn_OTFin__linear__lemma1_2,19,cls_conjecture_1,cls_conjecture_4,cls_conjecture_5]) ).
cnf(29,plain,
c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_n,t_a),v_n,tc_set(tc_set(t_a))),
inference('UR-RESOLVE',[status(thm)],[cls_Zorn_OTFin__linear__lemma1_1,19,cls_conjecture_1,cls_conjecture_4,cls_conjecture_5]) ).
cnf(30,plain,
c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_n,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference('UR-RESOLVE',[status(thm)],[cls_Zorn_OTFin__linear__lemma1_0,19,cls_conjecture_1,cls_conjecture_4,cls_conjecture_5]) ).
cnf(32,plain,
~ c_lessequals(c_Zorn_Osucc(v_S,c_Zorn_OTFin__linear__lemma1__1(v_S,v_n,t_a),t_a),v_n,tc_set(tc_set(t_a))),
inference('UR-RESOLVE',[status(thm)],[cls_Zorn_OTFin__linear__lemma1_3,19,cls_conjecture_1,cls_conjecture_4,cls_conjecture_5]) ).
cnf(34,plain,
( c_lessequals(v_n,v_x,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),v_x,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_n,tc_set(tc_set(t_a))) ),
inference('HYPERRESOLVE',[status(thm)],[cls_Zorn_OTFin__linear__lemma1_1,19,cls_conjecture_1]) ).
cnf(36,plain,
( c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| c_lessequals(v_n,v_x,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_n,tc_set(tc_set(t_a))) ),
inference('HYPERRESOLVE',[status(thm)],[cls_Zorn_OTFin__linear__lemma1_0,19,cls_conjecture_1]) ).
cnf(41,plain,
c_in(c_Main_OsubsetI__1(v_x,v_n,tc_set(t_a)),c_Zorn_Osucc(X,v_x,t_a),tc_set(t_a)),
inference('HYPERRESOLVE',[status(thm)],[cls_Set_OsubsetD_0,15,cls_Zorn_OAbrial__axiom1_0]) ).
cnf(67,plain,
~ c_in(v_n,v_Y,tc_set(tc_set(t_a))),
inference('UR-RESOLVE',[status(thm)],[cls_conjecture_6,32,28,29,30]) ).
cnf(71,plain,
~ c_lessequals(c_Zorn_Osucc(X,v_x,t_a),v_n,tc_set(tc_set(t_a))),
inference('UR-RESOLVE',[status(thm)],[cls_Set_OsubsetD_0,41,17]) ).
cnf(72,plain,
( c_lessequals(v_n,v_x,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),v_x,tc_set(tc_set(t_a))) ),
inference('REWRITE',[status(thm)],[34,71]) ).
cnf(73,plain,
( c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| c_lessequals(v_n,v_x,tc_set(tc_set(t_a))) ),
inference('REWRITE',[status(thm)],[36,71]) ).
cnf(159,plain,
( c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| v_n = v_x ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[cls_conjecture_6,73,cls_conjecture_1,cls_conjecture_3]),cls_conjecture_5]) ).
cnf(163,plain,
( v_n = v_x
| c_lessequals(v_n,v_x,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),t_a),v_x,tc_set(tc_set(t_a)))
| c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a) = v_x ),
inference('HYPERRESOLVE',[status(thm)],[cls_conjecture_6,159,72,cls_conjecture_3]) ).
cnf(750,plain,
( v_n = v_x
| c_lessequals(v_n,v_x,tc_set(tc_set(t_a)))
| c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a) = v_x ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[cls_Zorn_OTFin__linear__lemma1_3,163,19,cls_conjecture_1]),71]) ).
cnf(752,plain,
( v_n = v_x
| c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a) = v_x ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[cls_conjecture_6,750,cls_conjecture_1,cls_conjecture_3]),cls_conjecture_5]) ).
cnf(755,plain,
( v_n = v_x
| c_lessequals(v_n,v_x,tc_set(tc_set(t_a))) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[cls_Zorn_OTFin__linear__lemma1_2,752,19,cls_conjecture_1]),71]) ).
cnf(769,plain,
v_n = v_x,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[cls_conjecture_6,755,cls_conjecture_1,cls_conjecture_3]),cls_conjecture_5]) ).
cnf(770,plain,
$false,
inference('REWRITE',[status(thm)],[cls_conjecture_3,67,769,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET857-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n010.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 Jul 10 19:13:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 2022-07-10T19:13:15
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n010.cluster.edu at 2022-07-10T19:13:15
% 1.07/1.27
% 1.07/1.27
% 1.07/1.27 #||
% 1.07/1.27 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.07/1.27 % SZS output start Refutation
% See solution above
% 1.07/1.27 ||#
% 1.07/1.27
% 1.07/1.27 ; Summary of computation:
% 1.07/1.27 ; 1903 formulas have been input or derived (from 221 formulas).
% 1.07/1.27 ; 770 (40%) were retained. Of these,
% 1.07/1.27 ; 594 (77%) were simplified or subsumed later,
% 1.07/1.27 ; 176 (23%) are still being kept.
% 1.07/1.27 ;
% 1.07/1.27 ; Run time in seconds excluding printing time:
% 1.07/1.27 ; 0.005 1% Read assertion file (1 call)
% 1.07/1.27 ; 0.000 0% Assert (14 calls)
% 1.07/1.27 ; 0.115 14% Process new row (1,251 calls)
% 1.07/1.27 ; 0.067 8% Resolution (440 calls)
% 1.07/1.27 ; 0.006 1% Paramodulation (220 calls)
% 1.07/1.27 ; 0.001 0% Factoring (82 calls)
% 1.07/1.27 ; 0.011 1% Condensing (816 calls)
% 1.07/1.27 ; 0.408 51% Forward subsumption (816 calls)
% 1.07/1.27 ; 0.050 6% Backward subsumption (601 calls)
% 1.07/1.27 ; 0.010 1% Clause clause subsumption (4,552 calls)
% 1.07/1.27 ; 0.038 5% Forward simplification (1,225 calls)
% 1.07/1.27 ; 0.044 6% Backward simplification (770 calls)
% 1.07/1.27 ; 0.015 2% Ordering (6,345 calls)
% 1.07/1.27 ; 0.000 0% Sortal reasoning (32 calls)
% 1.07/1.27 ; 0.000 0% Purity testing (1 call)
% 1.07/1.27 ; 0.028 4% Other
% 1.07/1.27 ; 0.798 Total
% 1.07/1.27 ; 0.801 Real time
% 1.07/1.27 ;
% 1.07/1.27 ; Term-hash-array has 913 terms in all.
% 1.07/1.27 ; Feature-vector-row-index has 110 entries (573 at peak, 601 added, 491 deleted).
% 1.07/1.27 ; Feature-vector-row-index has 1,976 nodes (9,482 at peak, 9,948 added, 7,972 deleted).
% 1.07/1.27 ; Retrieved 6,285 possibly forward subsuming rows in 816 calls.
% 1.07/1.27 ; Retrieved 932 possibly backward subsumed rows in 601 calls.
% 1.07/1.27 ; Path-index has 267 entries (912 at peak, 924 added, 657 deleted).
% 1.07/1.27 ; Path-index has 965 nodes (1,179 at peak, 1,179 added, 214 deleted).
% 1.07/1.27 ; Trie-index has 267 entries (912 at peak, 924 added, 657 deleted).
% 1.07/1.27 ; Trie-index has 1,989 nodes (5,530 at peak, 5,581 added, 3,592 deleted).
% 1.07/1.27 ; Retrieved 333 generalization terms in 3,924 calls.
% 1.07/1.27 ; Retrieved 170 instance terms in 168 calls.
% 1.07/1.27 ; Retrieved 13,756 unifiable terms in 4,334 calls.
% 1.07/1.27 ;
% 1.07/1.27 ; The agenda of backward simplifiable rows to process has 519 entries:
% 1.07/1.27 ; 519 with value 0
% 1.07/1.27 ; The agenda of rows to process has 8 entries:
% 1.07/1.27 ; 2 with value 36 1 with value 45 4 with value 48
% 1.07/1.27 ; 1 with value 39
% 1.07/1.27 ; The agenda of rows to give has 106 entries:
% 1.07/1.27 ; 1 with value (4 12) 3 with value (4 61) 1 with value (4 88)
% 1.07/1.27 ; 2 with value (4 40) 1 with value (4 62) 3 with value (4 90)
% 1.07/1.27 ; 4 with value (4 41) 2 with value (4 63) 4 with value (4 93)
% 1.07/1.27 ; 3 with value (4 42) 1 with value (4 64) 1 with value (4 94)
% 1.07/1.27 ; 5 with value (4 43) 2 with value (4 66) 3 with value (4 95)
% 1.07/1.27 ; 1 with value (4 44) 2 with value (4 67) 3 with value (4 98)
% 1.07/1.27 ; 4 with value (4 45) 1 with value (4 68) 1 with value (4 99)
% 1.07/1.27 ; 2 with value (4 47) 3 with value (4 72) 3 with value (4 100)
% 1.07/1.27 ; 2 with value (4 48) 3 with value (4 73) 2 with value (4 103)
% 1.07/1.27 ; 3 with value (4 50) 1 with value (4 75) 3 with value (4 105)
% 1.07/1.27 ; 1 with value (4 51) 2 with value (4 76) 1 with value (4 107)
% 1.07/1.27 ; 1 with value (4 52) 3 with value (4 77) 1 with value (4 108)
% 1.07/1.27 ; 2 with value (4 53) 1 with value (4 78) 1 with value (4 109)
% 1.07/1.27 ; 2 with value (4 54) 1 with value (4 79) 2 with value (4 116)
% 1.07/1.27 ; 1 with value (4 55) 1 with value (4 81) 2 with value (4 119)
% 1.07/1.27 ; 1 with value (4 56) 1 with value (4 82) 1 with value (4 121)
% 1.07/1.27 ; 1 with value (4 58) 1 with value (4 83) 2 with value (4 126)
% 1.07/1.27 ; 1 with value (4 59) 2 with value (4 84) 1 with value (4 129)
% 1.07/1.27 ; 2 with value (4 60) 1 with value (4 86)
% 1.07/1.27 Evaluation took:
% 1.07/1.27 0.801 seconds of real time
% 1.07/1.27 0.756647 seconds of user run time
% 1.07/1.27 0.044839 seconds of system run time
% 1.07/1.27 [Run times include 0.044 seconds GC run time.]
% 1.07/1.27 0 calls to %EVAL
% 1.07/1.27 0 page faults and
% 1.07/1.27 91,919,992 bytes consed.
% 1.07/1.27 :PROOF-FOUND
% 1.07/1.27 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-10T19:13:16
% 1.07/1.27 :PROOF-FOUND
% 1.07/1.27 *
%------------------------------------------------------------------------------