TSTP Solution File: LCL442-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL442-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 14:22:59 EDT 2022
% Result : Unsatisfiable 0.56s 0.72s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of clauses : 26 ( 8 unt; 7 nHn; 16 RR)
% Number of literals : 46 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 28 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
( c_in(v_pl1,c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Oeval(v_tt,v_pl1,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
( c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))
| c_PropLog_Oeval(v_tt,v_pl1,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_2,negated_conjecture,
( c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Oeval(v_tt,v_pl2,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_3,negated_conjecture,
( c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a))
| c_PropLog_Oeval(v_tt,v_pl2,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_4,negated_conjecture,
( c_PropLog_Oeval(v_tt,v_pl1,t_a)
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_5,negated_conjecture,
( ~ c_PropLog_Oeval(v_tt,v_pl2,t_a)
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(cls_conjecture_9,negated_conjecture,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| c_PropLog_Oeval(v_tt,v_pl2,t_a)
| ~ c_PropLog_Oeval(v_tt,v_pl1,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_9) ).
cnf(cls_PropLog_Ofalse__imp_0,axiom,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X,c_PropLog_Opl_Ofalse,Y),c_PropLog_Othms(Z,Y),tc_PropLog_Opl(Y))
| c_in(c_PropLog_Opl_Oop_A_N_62(X,U,Y),c_PropLog_Othms(Z,Y),tc_PropLog_Opl(Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Ofalse__imp_0) ).
cnf(cls_PropLog_Oimp__false_0,axiom,
( ~ c_in(X,c_PropLog_Othms(Y,Z),tc_PropLog_Opl(Z))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(U,c_PropLog_Opl_Ofalse,Z),c_PropLog_Othms(Y,Z),tc_PropLog_Opl(Z))
| c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X,U,Z),c_PropLog_Opl_Ofalse,Z),c_PropLog_Othms(Y,Z),tc_PropLog_Opl(Z)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oimp__false_0) ).
cnf(cls_PropLog_Oweaken__left__Un1_0,axiom,
( ~ c_in(X,c_PropLog_Othms(Y,Z),tc_PropLog_Opl(Z))
| c_in(X,c_PropLog_Othms(c_union(Y,U,tc_PropLog_Opl(Z)),Z),tc_PropLog_Opl(Z)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oweaken__left__Un1_0) ).
cnf(cls_PropLog_Oweaken__left__Un2_0,axiom,
( ~ c_in(X,c_PropLog_Othms(Y,Z),tc_PropLog_Opl(Z))
| c_in(X,c_PropLog_Othms(c_union(U,Y,tc_PropLog_Opl(Z)),Z),tc_PropLog_Opl(Z)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oweaken__left__Un2_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/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oweaken__right_0) ).
cnf(15,plain,
( c_PropLog_Oeval(v_tt,v_pl1,t_a)
| c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,X,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) ),
inference('HYPERRESOLVE',[status(thm)],[cls_PropLog_Ofalse__imp_0,cls_conjecture_1]) ).
cnf(16,plain,
( c_PropLog_Oeval(v_tt,v_pl2,t_a)
| c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,X,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)) ),
inference('HYPERRESOLVE',[status(thm)],[cls_PropLog_Ofalse__imp_0,cls_conjecture_3]) ).
cnf(19,plain,
( c_PropLog_Oeval(v_tt,v_pl1,t_a)
| c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,X,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),Y,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ),
inference('HYPERRESOLVE',[status(thm)],[cls_PropLog_Oweaken__left__Un1_0,15]) ).
cnf(22,plain,
( c_PropLog_Oeval(v_tt,v_pl2,t_a)
| c_in(c_PropLog_Opl_Oop_A_N_62(v_pl2,X,t_a),c_PropLog_Othms(c_union(Y,c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ),
inference('HYPERRESOLVE',[status(thm)],[cls_PropLog_Oweaken__left__Un2_0,16]) ).
cnf(36,plain,
c_PropLog_Oeval(v_tt,v_pl1,t_a),
inference('HYPERRESOLVE',[status(thm)],[cls_conjecture_4,19]) ).
cnf(37,plain,
c_in(v_pl1,c_PropLog_Othms(c_PropLog_Ohyps(v_pl1,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)),
inference('REWRITE',[status(thm)],[cls_conjecture_0,36]) ).
cnf(38,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| c_PropLog_Oeval(v_tt,v_pl2,t_a) ),
inference('REWRITE',[status(thm)],[cls_conjecture_9,36]) ).
cnf(41,plain,
c_in(v_pl1,c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),X,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference('HYPERRESOLVE',[status(thm)],[cls_PropLog_Oweaken__left__Un1_0,37]) ).
cnf(74,plain,
( c_PropLog_Oeval(v_tt,v_pl2,t_a)
| c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ),
inference('HYPERRESOLVE',[status(thm)],[cls_PropLog_Oimp__false_0,22,41]) ).
cnf(252,plain,
c_PropLog_Oeval(v_tt,v_pl2,t_a),
inference('HYPERRESOLVE',[status(thm)],[38,74]) ).
cnf(253,plain,
c_in(v_pl2,c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)),
inference('REWRITE',[status(thm)],[cls_conjecture_2,252]) ).
cnf(254,plain,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_pl1,v_pl2,t_a),c_PropLog_Othms(c_union(c_PropLog_Ohyps(v_pl1,v_tt,t_a),c_PropLog_Ohyps(v_pl2,v_tt,t_a),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference('REWRITE',[status(thm)],[cls_conjecture_5,252]) ).
cnf(255,plain,
c_in(c_PropLog_Opl_Oop_A_N_62(X,v_pl2,t_a),c_PropLog_Othms(c_PropLog_Ohyps(v_pl2,v_tt,t_a),t_a),tc_PropLog_Opl(t_a)),
inference('HYPERRESOLVE',[status(thm)],[cls_PropLog_Oweaken__right_0,253]) ).
cnf(259,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[cls_PropLog_Oweaken__left__Un2_0,254]),255]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL442-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 : Sun Jul 3 10:23:21 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 2022-07-03T10:23:21
% 0.20/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-07-03T10:23:21
% 0.56/0.72
% 0.56/0.72
% 0.56/0.72 #||
% 0.56/0.72 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.56/0.72 % SZS output start Refutation
% See solution above
% 0.56/0.72 ||#
% 0.56/0.72
% 0.56/0.72 ; Summary of computation:
% 0.56/0.72 ; 488 formulas have been input or derived (from 69 formulas).
% 0.56/0.72 ; 259 (53%) were retained. Of these,
% 0.56/0.72 ; 173 (67%) were simplified or subsumed later,
% 0.56/0.72 ; 86 (33%) are still being kept.
% 0.56/0.72 ;
% 0.56/0.72 ; Run time in seconds excluding printing time:
% 0.56/0.72 ; 0.004 2% Read assertion file (1 call)
% 0.56/0.72 ; 0.001 0% Assert (12 calls)
% 0.56/0.72 ; 0.039 16% Process new row (453 calls)
% 0.56/0.72 ; 0.030 12% Resolution (136 calls)
% 0.56/0.73 ; 0.001 0% Paramodulation (68 calls)
% 0.56/0.73 ; 0.000 0% Factoring (21 calls)
% 0.56/0.73 ; 0.004 2% Condensing (235 calls)
% 0.56/0.73 ; 0.092 38% Forward subsumption (235 calls)
% 0.56/0.73 ; 0.012 5% Backward subsumption (178 calls)
% 0.56/0.73 ; 0.005 2% Clause clause subsumption (2,693 calls)
% 0.56/0.73 ; 0.010 4% Forward simplification (414 calls)
% 0.56/0.73 ; 0.015 6% Backward simplification (259 calls)
% 0.56/0.73 ; 0.000 0% Ordering (262 calls)
% 0.56/0.73 ; 0.001 0% Sortal reasoning (32 calls)
% 0.56/0.73 ; 0.000 0% Purity testing (1 call)
% 0.56/0.73 ; 0.026 11% Other
% 0.56/0.73 ; 0.240 Total
% 0.56/0.73 ; 0.242 Real time
% 0.56/0.73 ;
% 0.56/0.73 ; Term-hash-array has 721 terms in all.
% 0.56/0.73 ; Feature-vector-row-index has 5 entries (155 at peak, 178 added, 173 deleted).
% 0.56/0.73 ; Feature-vector-row-index has 39 nodes (889 at peak, 1,182 added, 1,143 deleted).
% 0.56/0.73 ; Retrieved 2,499 possibly forward subsuming rows in 235 calls.
% 0.56/0.73 ; Retrieved 666 possibly backward subsumed rows in 178 calls.
% 0.56/0.73 ; Path-index has 267 entries (685 at peak, 752 added, 485 deleted).
% 0.56/0.73 ; Path-index has 1,232 nodes (1,365 at peak, 1,436 added, 204 deleted).
% 0.56/0.73 ; Trie-index has 267 entries (685 at peak, 752 added, 485 deleted).
% 0.56/0.73 ; Trie-index has 2,100 nodes (5,662 at peak, 6,155 added, 4,055 deleted).
% 0.56/0.73 ; Retrieved 99 generalization terms in 563 calls.
% 0.56/0.73 ; Retrieved 80 instance terms in 80 calls.
% 0.56/0.73 ; Retrieved 2,093 unifiable terms in 1,001 calls.
% 0.56/0.73 ;
% 0.56/0.73 ; The agenda of rows to process has 2 entries:
% 0.56/0.73 ; 1 with value 22 1 with value 25
% 0.56/0.73 ; The agenda of rows to give has 44 entries:
% 0.56/0.73 ; 1 with value (4 9) 8 with value (4 35) 20 with value (4 37)
% 0.56/0.73 ; 2 with value (4 17) 3 with value (4 36) 8 with value (4 39)
% 0.56/0.73 ; 2 with value (4 19)
% 0.56/0.73 Evaluation took:
% 0.56/0.73 0.243 seconds of real time
% 0.56/0.73 0.218139 seconds of user run time
% 0.56/0.73 0.023924 seconds of system run time
% 0.56/0.73 [Run times include 0.007 seconds GC run time.]
% 0.56/0.73 0 calls to %EVAL
% 0.56/0.73 0 page faults and
% 0.56/0.73 22,991,520 bytes consed.
% 0.56/0.73 :PROOF-FOUND
% 0.56/0.73 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-03T10:23:21
% 0.56/0.73 :PROOF-FOUND
% 0.56/0.73 *
%------------------------------------------------------------------------------