TSTP Solution File: SET851-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SET851-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n024.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:49 EDT 2022
% Result : Unsatisfiable 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 11 ( 8 unt; 2 nHn; 9 RR)
% Number of literals : 16 ( 2 equ; 6 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 7 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_Osubset__refl_0,axiom,
c_lessequals(X,X,tc_set(Y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__refl_0) ).
cnf(cls_Zorn_Osucc__trans_0,axiom,
( ~ c_lessequals(X,Y,tc_set(tc_set(Z)))
| c_lessequals(X,c_Zorn_Osucc(U,Y,Z),tc_set(tc_set(Z))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_Osucc__trans_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_4,negated_conjecture,
( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a)))
| c_lessequals(v_x,v_m,tc_set(tc_set(t_a))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_5,negated_conjecture,
( c_lessequals(c_Zorn_Osucc(v_S,X,t_a),v_m,tc_set(tc_set(t_a)))
| X = v_m
| ~ c_lessequals(X,v_m,tc_set(tc_set(t_a)))
| ~ c_in(X,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(9,plain,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a))),
inference('UR-RESOLVE',[status(thm)],[cls_Zorn_Osucc__trans_0,cls_conjecture_3]) ).
cnf(10,plain,
c_lessequals(v_x,v_m,tc_set(tc_set(t_a))),
inference('REWRITE',[status(thm)],[cls_conjecture_4,9]) ).
cnf(12,plain,
v_x = v_m,
inference('UR-RESOLVE',[status(thm)],[cls_conjecture_5,cls_conjecture_2,10,cls_conjecture_1]) ).
cnf(15,plain,
$false,
inference('REWRITE',[status(thm)],[cls_conjecture_3,cls_Set_Osubset__refl_0,12,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET851-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 10 18:19:58 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 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/sandbox/benchmark/theBenchmark.p 2022-07-10T18:19:58
% 0.20/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2022-07-10T18:19:58
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 #||
% 0.20/0.51 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.51 % SZS output start Refutation
% See solution above
% 0.20/0.52 ||#
% 0.20/0.52
% 0.20/0.52 ; Summary of computation:
% 0.20/0.52 ; 21 formulas have been input or derived (from 8 formulas).
% 0.20/0.52 ; 15 (71%) were retained. Of these,
% 0.20/0.52 ; 7 (47%) were simplified or subsumed later,
% 0.20/0.52 ; 8 (53%) are still being kept.
% 0.20/0.52 ;
% 0.20/0.52 ; Run time in seconds excluding printing time:
% 0.20/0.52 ; 0.003 10% Read assertion file (1 call)
% 0.20/0.52 ; 0.000 0% Assert (7 calls)
% 0.20/0.52 ; 0.003 10% Process new row (16 calls)
% 0.20/0.52 ; 0.000 0% Resolution (14 calls)
% 0.20/0.52 ; 0.000 0% Paramodulation (7 calls)
% 0.20/0.52 ; 0.000 0% Condensing (3 calls)
% 0.20/0.52 ; 0.000 0% Forward subsumption (3 calls)
% 0.20/0.52 ; 0.000 0% Backward subsumption (3 calls)
% 0.20/0.52 ; 0.000 0% Clause clause subsumption (1 call)
% 0.20/0.52 ; 0.000 0% Forward simplification (16 calls)
% 0.20/0.52 ; 0.001 3% Backward simplification (15 calls)
% 0.20/0.52 ; 0.000 0% Ordering (5 calls)
% 0.20/0.52 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.52 ; 0.000 0% Purity testing (1 call)
% 0.20/0.52 ; 0.022 76% Other
% 0.20/0.52 ; 0.029 Total
% 0.20/0.52 ; 0.031 Real time
% 0.20/0.52 ;
% 0.20/0.52 ; Term-hash-array has 29 terms in all.
% 0.20/0.52 ; Feature-vector-row-index has 2 entries (3 at peak, 3 added, 1 deleted).
% 0.20/0.52 ; Feature-vector-row-index has 35 nodes (51 at peak, 51 added, 16 deleted).
% 0.20/0.52 ; Retrieved 1 possibly forward subsuming row in 3 calls.
% 0.20/0.52 ; Retrieved 0 possibly backward subsumed rows in 3 calls.
% 0.20/0.52 ; Path-index has 25 entries (31 at peak, 35 added, 10 deleted).
% 0.20/0.52 ; Path-index has 71 nodes (79 at peak, 83 added, 12 deleted).
% 0.20/0.52 ; Trie-index has 25 entries (31 at peak, 35 added, 10 deleted).
% 0.20/0.52 ; Trie-index has 75 nodes (104 at peak, 124 added, 49 deleted).
% 0.20/0.52 ; Retrieved 17 generalization terms in 17 calls.
% 0.20/0.52 ; Retrieved 13 instance terms in 11 calls.
% 0.20/0.52 ; Retrieved 59 unifiable terms in 63 calls.
% 0.20/0.52 ;
% 0.20/0.52 ; The agenda of backward simplifiable rows to process has 3 entries:
% 0.20/0.52 ; 3 with value 0
% 0.20/0.52 ; The agenda of rows to process has 1 entry:
% 0.20/0.52 ; 1 with value 17
% 0.20/0.52 ; The agenda of input rows to give has 2 entries:
% 0.20/0.52 ; 1 with value 11 1 with value 12
% 0.20/0.52 ; The agenda of rows to give has 2 entries:
% 0.20/0.52 ; 1 with value (4 5) 1 with value (4 13)
% 0.20/0.52 Evaluation took:
% 0.20/0.52 0.031 seconds of real time
% 0.20/0.52 0.024323 seconds of user run time
% 0.20/0.52 0.007097 seconds of system run time
% 0.20/0.52 0 calls to %EVAL
% 0.20/0.52 0 page faults and
% 0.20/0.52 2,125,296 bytes consed.
% 0.20/0.52 :PROOF-FOUND
% 0.20/0.52 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-10T18:19:58
% 0.20/0.52 :PROOF-FOUND
% 0.20/0.52 *
%------------------------------------------------------------------------------