TSTP Solution File: LAT263-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LAT263-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n026.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:07 EDT 2022
% Result : Unsatisfiable 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of clauses : 11 ( 8 unt; 0 nHn; 9 RR)
% Number of literals : 18 ( 3 equ; 8 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 : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
c_lessequals(v_S,v_A,tc_set(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_in(c_Tarski_Oglb(v_S,v_cl,t_a),v_A,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Tarski_OA_A_61_61_Apset_Acl_0,axiom,
v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_OA_A_61_61_Apset_Acl_0) ).
cnf(cls_Tarski_OCL_Olub__in__lattice_0,axiom,
( ~ c_in(X,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(Y,tc_Product__Type_Ounit))
| ~ c_in(X,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(Y,tc_Product__Type_Ounit))
| ~ c_lessequals(Z,c_Tarski_Opotype_Opset(X,Y,tc_Product__Type_Ounit),tc_set(Y))
| c_in(c_Tarski_Olub(Z,X,Y),c_Tarski_Opotype_Opset(X,Y,tc_Product__Type_Ounit),Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_OCL_Olub__in__lattice_0) ).
cnf(cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0,axiom,
c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0) ).
cnf(cls_Tarski_Odual_Acl_A_58_APartialOrder_0,axiom,
c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_Odual_Acl_A_58_APartialOrder_0) ).
cnf(cls_Tarski_Oglb__dual__lub_0,axiom,
c_Tarski_Oglb(X,Y,Z) = c_Tarski_Olub(X,c_Tarski_Odual(Y,Z),Z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_Oglb__dual__lub_0) ).
cnf(cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0,axiom,
c_Tarski_Opotype_Opset(c_Tarski_Odual(X,Y),Y,tc_Product__Type_Ounit) = c_Tarski_Opotype_Opset(X,Y,tc_Product__Type_Ounit),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0) ).
cnf(10,plain,
( ~ c_in(c_Tarski_Odual(X,Y),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(Y,tc_Product__Type_Ounit))
| ~ c_in(c_Tarski_Odual(X,Y),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(Y,tc_Product__Type_Ounit))
| ~ c_lessequals(Z,c_Tarski_Opotype_Opset(X,Y,tc_Product__Type_Ounit),tc_set(Y))
| c_in(c_Tarski_Oglb(Z,X,Y),c_Tarski_Opotype_Opset(X,Y,tc_Product__Type_Ounit),Y) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[cls_Tarski_OCL_Olub__in__lattice_0,cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0,theory(equality)]),cls_Tarski_Oglb__dual__lub_0,theory(equality)]) ).
cnf(11,plain,
( ~ c_lessequals(X,v_A,tc_set(t_a))
| c_in(c_Tarski_Oglb(X,v_cl,t_a),v_A,t_a) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,cls_Tarski_OA_A_61_61_Apset_Acl_0,theory(equality)]),cls_Tarski_Odual_Acl_A_58_APartialOrder_0,cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0]) ).
cnf(13,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[11,cls_conjecture_0,cls_conjecture_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT263-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n026.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 : Wed Jun 29 05:57:03 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 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.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48 (USE-FACTORING :POS)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48 *
% 0.19/0.48 "."
% 0.19/0.48 *
% 0.19/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-29T05:57:03
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-06-29T05:57:03
% 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.51 ||#
% 0.19/0.51
% 0.19/0.51 ; Summary of computation:
% 0.19/0.51 ; 19 formulas have been input or derived (from 12 formulas).
% 0.19/0.51 ; 13 (68%) were retained. Of these,
% 0.19/0.51 ; 13 (100%) are still being kept.
% 0.19/0.51 ;
% 0.19/0.51 ; Run time in seconds excluding printing time:
% 0.19/0.51 ; 0.002 7% Read assertion file (1 call)
% 0.19/0.51 ; 0.000 0% Assert (8 calls)
% 0.19/0.51 ; 0.002 7% Process new row (16 calls)
% 0.19/0.51 ; 0.001 4% Resolution (22 calls)
% 0.19/0.51 ; 0.000 0% Paramodulation (11 calls)
% 0.19/0.51 ; 0.000 0% Condensing (5 calls)
% 0.19/0.51 ; 0.000 0% Forward subsumption (5 calls)
% 0.19/0.51 ; 0.000 0% Backward subsumption (5 calls)
% 0.19/0.51 ; 0.000 0% Clause clause subsumption (1 call)
% 0.19/0.51 ; 0.002 7% Forward simplification (16 calls)
% 0.19/0.51 ; 0.000 0% Backward simplification (13 calls)
% 0.19/0.51 ; 0.000 0% Ordering (20 calls)
% 0.19/0.51 ; 0.000 0% Sortal reasoning (32 calls)
% 0.19/0.51 ; 0.000 0% Purity testing (1 call)
% 0.19/0.51 ; 0.021 75% Other
% 0.19/0.51 ; 0.028 Total
% 0.19/0.51 ; 0.031 Real time
% 0.19/0.51 ;
% 0.19/0.51 ; Term-hash-array has 41 terms in all.
% 0.19/0.51 ; Feature-vector-row-index has 5 entries (5 at peak, 5 added, 0 deleted).
% 0.19/0.51 ; Feature-vector-row-index has 71 nodes (71 at peak, 71 added, 0 deleted).
% 0.19/0.51 ; Retrieved 1 possibly forward subsuming row in 5 calls.
% 0.19/0.51 ; Retrieved 0 possibly backward subsumed rows in 5 calls.
% 0.19/0.51 ; Path-index has 48 entries (48 at peak, 48 added, 0 deleted).
% 0.19/0.51 ; Path-index has 183 nodes (183 at peak, 183 added, 0 deleted).
% 0.19/0.51 ; Trie-index has 48 entries (48 at peak, 48 added, 0 deleted).
% 0.19/0.51 ; Trie-index has 193 nodes (193 at peak, 193 added, 0 deleted).
% 0.19/0.51 ; Retrieved 3 generalization terms in 30 calls.
% 0.19/0.51 ; Retrieved 7 instance terms in 7 calls.
% 0.19/0.51 ; Retrieved 30 unifiable terms in 102 calls.
% 0.19/0.51 ;
% 0.19/0.51 ; The agenda of rows to process has 2 entries:
% 0.19/0.51 ; 1 with value 10 1 with value 12
% 0.19/0.51 ; The agenda of rows to give has 1 entry:
% 0.19/0.51 ; 1 with value (4 53)
% 0.19/0.51 Evaluation took:
% 0.19/0.51 0.031 seconds of real time
% 0.19/0.51 0.025101 seconds of user run time
% 0.19/0.51 0.006056 seconds of system run time
% 0.19/0.51 0 calls to %EVAL
% 0.19/0.51 0 page faults and
% 0.19/0.51 2,280,672 bytes consed.
% 0.19/0.51 :PROOF-FOUND
% 0.19/0.51 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-29T05:57:03
% 0.19/0.51 :PROOF-FOUND
% 0.19/0.51 *
%------------------------------------------------------------------------------