TSTP Solution File: LCL434-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL434-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n004.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 14:22:52 EDT 2022
% Result : Unsatisfiable 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 7 unt; 2 nHn; 9 RR)
% Number of literals : 16 ( 3 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 14 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_pa,c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_PropLog_Othms_OH_0,axiom,
( ~ c_in(X,Y,tc_PropLog_Opl(Z))
| c_in(X,c_PropLog_Othms(Y,Z),tc_PropLog_Opl(Z)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Othms_OH_0) ).
cnf(cls_PropLog_Othms__I_0,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(X,X,Y),c_PropLog_Othms(Z,Y),tc_PropLog_Opl(Y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Othms__I_0) ).
cnf(cls_PropLog_Oweaken__right_0,axiom,
( ~ c_in(X,c_PropLog_Othms(Y,Z),tc_PropLog_Opl(Z))
| c_in(c_PropLog_Opl_Oop_A_N_62(U,X,Z),c_PropLog_Othms(Y,Z),tc_PropLog_Opl(Z)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Oweaken__right_0) ).
cnf(cls_Set_OinsertE_0,axiom,
( ~ c_in(X,c_insert(Y,Z,U),U)
| c_in(X,Z,U)
| X = Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OinsertE_0) ).
cnf(9,plain,
( c_in(v_pa,v_H,tc_PropLog_Opl(t_a))
| v_pa = v_p ),
inference('HYPERRESOLVE',[status(thm)],[cls_Set_OinsertE_0,cls_conjecture_0]) ).
cnf(10,plain,
~ c_in(v_pa,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference('UR-RESOLVE',[status(thm)],[cls_PropLog_Oweaken__right_0,cls_conjecture_1]) ).
cnf(12,plain,
~ c_in(v_pa,v_H,tc_PropLog_Opl(t_a)),
inference('UR-RESOLVE',[status(thm)],[cls_PropLog_Othms_OH_0,10]) ).
cnf(13,plain,
v_pa = v_p,
inference('REWRITE',[status(thm)],[9,12]) ).
cnf(15,plain,
$false,
inference('REWRITE',[status(thm)],[cls_conjecture_1,cls_PropLog_Othms__I_0,13,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL434-2 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.13 % Command : run-snark %s %d
% 0.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 3 12:34:38 EDT 2022
% 0.14/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-07-03T12:34:38
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n004.cluster.edu at 2022-07-03T12:34:38
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 #||
% 0.20/0.49 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.49 % SZS output start Refutation
% See solution above
% 0.20/0.50 ||#
% 0.20/0.50
% 0.20/0.50 ; Summary of computation:
% 0.20/0.50 ; 23 formulas have been input or derived (from 8 formulas).
% 0.20/0.50 ; 15 (65%) were retained. Of these,
% 0.20/0.50 ; 7 (47%) were simplified or subsumed later,
% 0.20/0.50 ; 8 (53%) are still being kept.
% 0.20/0.50 ;
% 0.20/0.50 ; Run time in seconds excluding printing time:
% 0.20/0.50 ; 0.002 7% Read assertion file (1 call)
% 0.20/0.50 ; 0.001 4% Assert (6 calls)
% 0.20/0.50 ; 0.001 4% Process new row (18 calls)
% 0.20/0.50 ; 0.001 4% Resolution (14 calls)
% 0.20/0.50 ; 0.000 0% Paramodulation (7 calls)
% 0.20/0.50 ; 0.001 4% Condensing (4 calls)
% 0.20/0.50 ; 0.000 0% Forward subsumption (4 calls)
% 0.20/0.50 ; 0.000 0% Backward subsumption (4 calls)
% 0.20/0.50 ; 0.000 0% Clause clause subsumption (1 call)
% 0.20/0.50 ; 0.001 4% Forward simplification (18 calls)
% 0.20/0.50 ; 0.000 0% Backward simplification (15 calls)
% 0.20/0.50 ; 0.000 0% Ordering (2 calls)
% 0.20/0.50 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.50 ; 0.000 0% Purity testing (1 call)
% 0.20/0.50 ; 0.020 74% Other
% 0.20/0.50 ; 0.027 Total
% 0.20/0.50 ; 0.029 Real time
% 0.20/0.50 ;
% 0.20/0.50 ; Term-hash-array has 31 terms in all.
% 0.20/0.50 ; Feature-vector-row-index has 3 entries (4 at peak, 4 added, 1 deleted).
% 0.20/0.50 ; Feature-vector-row-index has 12 nodes (22 at peak, 22 added, 10 deleted).
% 0.20/0.50 ; Retrieved 1 possibly forward subsuming row in 4 calls.
% 0.20/0.50 ; Retrieved 0 possibly backward subsumed rows in 4 calls.
% 0.20/0.50 ; Path-index has 26 entries (34 at peak, 40 added, 14 deleted).
% 0.20/0.50 ; Path-index has 93 nodes (110 at peak, 123 added, 30 deleted).
% 0.20/0.50 ; Trie-index has 26 entries (34 at peak, 40 added, 14 deleted).
% 0.20/0.50 ; Trie-index has 76 nodes (114 at peak, 131 added, 55 deleted).
% 0.20/0.50 ; Retrieved 6 generalization terms in 19 calls.
% 0.20/0.50 ; Retrieved 11 instance terms in 10 calls.
% 0.20/0.50 ; Retrieved 78 unifiable terms in 55 calls.
% 0.20/0.50 ;
% 0.20/0.50 ; The agenda of backward simplifiable rows to process has 4 entries:
% 0.20/0.50 ; 4 with value 0
% 0.20/0.50 ; The agenda of input rows to give has 1 entry:
% 0.20/0.50 ; 1 with value 12
% 0.20/0.50 ; The agenda of rows to give has 2 entries:
% 0.20/0.50 ; 1 with value (4 5) 1 with value (4 17)
% 0.20/0.50 Evaluation took:
% 0.20/0.50 0.029 seconds of real time
% 0.20/0.50 0.025509 seconds of user run time
% 0.20/0.50 0.0039 seconds of system run time
% 0.20/0.50 0 calls to %EVAL
% 0.20/0.50 0 page faults and
% 0.20/0.50 2,051,040 bytes consed.
% 0.20/0.50 :PROOF-FOUND
% 0.20/0.50 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T12:34:38
% 0.20/0.50 :PROOF-FOUND
% 0.20/0.50 *
%------------------------------------------------------------------------------