TSTP Solution File: SET852-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SET852-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n025.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:50 EDT 2022
% Result : Unsatisfiable 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 6
% Syntax : Number of clauses : 10 ( 6 unt; 4 nHn; 9 RR)
% Number of literals : 18 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_2,negated_conjecture,
~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_4,negated_conjecture,
( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),X,tc_set(tc_set(t_a)))
| c_lessequals(X,v_m,tc_set(tc_set(t_a)))
| ~ c_in(X,v_Y,tc_set(tc_set(t_a))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_Zorn_OUnion__lemma0_0,axiom,
( c_in(c_Zorn_OUnion__lemma0__1(X,Y,Z,U),Z,tc_set(U))
| c_lessequals(Y,c_Union(Z,U),tc_set(U))
| c_lessequals(c_Union(Z,U),X,tc_set(U)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_0) ).
cnf(cls_Zorn_OUnion__lemma0_1,axiom,
( ~ c_lessequals(c_Zorn_OUnion__lemma0__1(X,Y,Z,U),X,tc_set(U))
| c_lessequals(Y,c_Union(Z,U),tc_set(U))
| c_lessequals(c_Union(Z,U),X,tc_set(U)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_1) ).
cnf(cls_Zorn_OUnion__lemma0_2,axiom,
( ~ c_lessequals(X,c_Zorn_OUnion__lemma0__1(Y,X,Z,U),tc_set(U))
| c_lessequals(X,c_Union(Z,U),tc_set(U))
| c_lessequals(c_Union(Z,U),Y,tc_set(U)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_2) ).
cnf(7,plain,
c_in(c_Zorn_OUnion__lemma0__1(v_m,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_Y,tc_set(tc_set(t_a))),
inference('UR-RESOLVE',[status(thm)],[cls_Zorn_OUnion__lemma0_0,cls_conjecture_3,cls_conjecture_2]) ).
cnf(11,plain,
~ c_lessequals(c_Zorn_OUnion__lemma0__1(v_m,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
inference('UR-RESOLVE',[status(thm)],[cls_Zorn_OUnion__lemma0_1,cls_conjecture_3,cls_conjecture_2]) ).
cnf(13,plain,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_OUnion__lemma0__1(v_m,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
inference('UR-RESOLVE',[status(thm)],[cls_Zorn_OUnion__lemma0_2,cls_conjecture_3,cls_conjecture_2]) ).
cnf(16,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[cls_conjecture_4,7]),11,13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET852-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 05:29:16 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-10T05:29:16
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n025.cluster.edu at 2022-07-10T05:29:16
% 0.19/0.50
% 0.19/0.50
% 0.19/0.50 #||
% 0.19/0.50 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.50 % SZS output start Refutation
% See solution above
% 0.19/0.50 ||#
% 0.19/0.50
% 0.19/0.50 ; Summary of computation:
% 0.19/0.50 ; 16 formulas have been input or derived (from 10 formulas).
% 0.19/0.50 ; 16 (100%) were retained. Of these,
% 0.19/0.50 ; 16 (100%) are still being kept.
% 0.19/0.50 ;
% 0.19/0.50 ; Run time in seconds excluding printing time:
% 0.19/0.50 ; 0.002 7% Read assertion file (1 call)
% 0.19/0.50 ; 0.001 3% Assert (6 calls)
% 0.19/0.50 ; 0.002 7% Process new row (16 calls)
% 0.19/0.50 ; 0.001 3% Resolution (18 calls)
% 0.19/0.50 ; 0.000 0% Paramodulation (9 calls)
% 0.19/0.50 ; 0.000 0% Factoring (2 calls)
% 0.19/0.50 ; 0.000 0% Condensing (9 calls)
% 0.19/0.50 ; 0.001 3% Forward subsumption (9 calls)
% 0.19/0.50 ; 0.001 3% Backward subsumption (9 calls)
% 0.19/0.50 ; 0.000 0% Clause clause subsumption (8 calls)
% 0.19/0.50 ; 0.000 0% Forward simplification (16 calls)
% 0.19/0.50 ; 0.000 0% Backward simplification (16 calls)
% 0.19/0.50 ; 0.000 0% Ordering (31 calls)
% 0.19/0.50 ; 0.000 0% Sortal reasoning (32 calls)
% 0.19/0.50 ; 0.000 0% Purity testing (1 call)
% 0.19/0.50 ; 0.021 72% Other
% 0.19/0.50 ; 0.029 Total
% 0.19/0.50 ; 0.031 Real time
% 0.19/0.50 ;
% 0.19/0.50 ; Term-hash-array has 52 terms in all.
% 0.19/0.50 ; Feature-vector-row-index has 9 entries (9 at peak, 9 added, 0 deleted).
% 0.19/0.50 ; Feature-vector-row-index has 82 nodes (82 at peak, 82 added, 0 deleted).
% 0.19/0.50 ; Retrieved 6 possibly forward subsuming rows in 9 calls.
% 0.19/0.50 ; Retrieved 2 possibly backward subsumed rows in 9 calls.
% 0.19/0.50 ; Path-index has 56 entries (56 at peak, 56 added, 0 deleted).
% 0.19/0.50 ; Path-index has 228 nodes (228 at peak, 228 added, 0 deleted).
% 0.19/0.50 ; Trie-index has 56 entries (56 at peak, 56 added, 0 deleted).
% 0.19/0.50 ; Trie-index has 261 nodes (261 at peak, 261 added, 0 deleted).
% 0.19/0.50 ; Retrieved 2 generalization terms in 30 calls.
% 0.19/0.50 ; Retrieved 6 instance terms in 6 calls.
% 0.19/0.50 ; Retrieved 75 unifiable terms in 76 calls.
% 0.19/0.50 ;
% 0.19/0.50 ; The agenda of rows to give has 6 entries:
% 0.19/0.50 ; 1 with value (4 18) 1 with value (4 27) 2 with value (4 49)
% 0.19/0.50 ; 1 with value (4 21) 1 with value (4 30)
% 0.19/0.50 Evaluation took:
% 0.19/0.50 0.032 seconds of real time
% 0.19/0.50 0.02458 seconds of user run time
% 0.19/0.50 0.007582 seconds of system run time
% 0.19/0.50 0 calls to %EVAL
% 0.19/0.50 0 page faults and
% 0.19/0.50 2,440,112 bytes consed.
% 0.19/0.50 :PROOF-FOUND
% 0.19/0.50 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-10T05:29:16
% 0.19/0.50 :PROOF-FOUND
% 0.19/0.50 *
%------------------------------------------------------------------------------