TSTP Solution File: LCL004-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL004-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n019.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:19:31 EDT 2022
% Result : Unsatisfiable 11.21s 11.39s
% Output : Refutation 11.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 3
% Syntax : Number of clauses : 58 ( 57 unt; 0 nHn; 7 RR)
% Number of literals : 60 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 217 ( 124 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(or(not(X),Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(an_CAMerideth,axiom,
is_a_theorem(or(not(or(not(or(not(X),Y)),or(Z,or(U,V)))),or(not(or(not(U),X)),or(Z,or(V,X))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',an_CAMerideth) ).
cnf(an_3,negated_conjecture,
~ is_a_theorem(or(not(a),or(b,a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',an_3) ).
cnf(4,plain,
is_a_theorem(or(not(or(not(X),or(not(Y),Z))),or(not(or(not(U),Y)),or(or(V,Y),or(not(Y),Z))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,an_CAMerideth,an_CAMerideth]) ).
cnf(6,plain,
is_a_theorem(or(not(or(not(or(X,Y)),Z)),or(not(or(not(U),Y)),or(or(not(Y),V),Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,4,an_CAMerideth]) ).
cnf(10,plain,
is_a_theorem(or(not(or(not(or(not(X),Y)),or(Z,X))),or(not(or(not(U),X)),or(V,or(Z,X))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,6,an_CAMerideth]) ).
cnf(13,plain,
~ is_a_theorem(or(not(or(not(or(not(or(X,Y)),Z)),or(not(or(not(U),Y)),or(or(not(Y),V),Z)))),or(not(a),or(b,a)))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,6,an_3]) ).
cnf(16,plain,
is_a_theorem(or(not(or(not(X),or(not(Y),or(Z,Y)))),or(U,or(not(or(not(V),Y)),or(not(Y),or(Z,Y)))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,10,an_CAMerideth]) ).
cnf(17,plain,
is_a_theorem(or(not(or(not(X),or(or(not(Y),Z),Y))),or(U,or(not(or(not(V),Y)),or(or(not(Y),Z),Y))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,10,6]) ).
cnf(45,plain,
is_a_theorem(or(not(or(not(not(or(not(X),Y))),Z)),or(U,or(or(not(Y),or(V,Y)),Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,16,an_CAMerideth]) ).
cnf(53,plain,
is_a_theorem(or(X,or(not(or(not(Y),Z)),or(not(Z),or(or(not(U),or(V,U)),Z))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,45,16]) ).
cnf(55,plain,
is_a_theorem(or(not(or(not(X),Y)),or(or(not(Y),Z),or(U,or(or(not(V),or(W,V)),Y))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,45,6]) ).
cnf(60,plain,
is_a_theorem(or(not(or(not(X),Y)),or(not(Y),or(or(not(Z),or(U,Z)),Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,53,6]) ).
cnf(67,plain,
is_a_theorem(or(not(or(not(or(not(X),or(Y,X))),Z)),or(not(U),or(U,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,60,an_CAMerideth]) ).
cnf(78,plain,
is_a_theorem(or(X,or(not(or(not(Y),Z)),or(not(Z),or(Z,Z))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,67,16]) ).
cnf(99,plain,
is_a_theorem(or(not(or(not(X),Y)),or(not(Y),or(Y,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,78,6]) ).
cnf(107,plain,
is_a_theorem(or(not(or(not(X),Y)),or(not(X),or(X,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,99,an_CAMerideth]) ).
cnf(108,plain,
is_a_theorem(or(not(or(not(X),or(Y,Y))),or(Z,or(not(Y),or(Y,Y))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,99,10]) ).
cnf(118,plain,
is_a_theorem(or(not(or(not(X),X)),or(not(X),or(Y,X)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,107,an_CAMerideth]) ).
cnf(131,plain,
is_a_theorem(or(X,or(not(or(not(Y),Z)),or(not(Z),or(U,Z))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,118,16]) ).
cnf(236,plain,
is_a_theorem(or(not(or(not(not(X)),Y)),or(Z,or(or(X,X),Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,108,an_CAMerideth]) ).
cnf(309,plain,
is_a_theorem(or(not(or(not(or(X,X)),not(X))),or(Y,or(Z,not(X))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,236,an_CAMerideth]) ).
cnf(327,plain,
is_a_theorem(or(not(or(not(X),Y)),or(not(Y),or(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,131,6]) ).
cnf(341,plain,
is_a_theorem(or(not(or(not(X),Y)),or(not(Z),or(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,327,an_CAMerideth]) ).
cnf(343,plain,
is_a_theorem(or(not(or(not(X),or(Y,Z))),or(U,or(not(Z),or(Y,Z))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,327,10]) ).
cnf(381,plain,
is_a_theorem(or(not(or(not(X),Y)),or(not(X),or(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,341,an_CAMerideth]) ).
cnf(385,plain,
is_a_theorem(or(not(or(not(X),or(Y,Z))),or(U,or(not(Y),or(Y,Z))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,341,10]) ).
cnf(533,plain,
is_a_theorem(or(not(or(not(X),Y)),or(or(not(Z),U),or(or(or(not(V),or(W,V)),Z),Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,55,an_CAMerideth]) ).
cnf(648,plain,
is_a_theorem(or(not(or(not(or(or(not(X),or(Y,X)),Z)),U)),or(or(not(Z),V),or(W,U)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,533,an_CAMerideth]) ).
cnf(768,plain,
is_a_theorem(or(X,or(not(or(Y,not(Z))),or(U,or(Y,not(Z)))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,343,309]) ).
cnf(1036,plain,
is_a_theorem(or(not(or(X,not(Y))),or(Z,or(X,not(Y))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,768,6]) ).
cnf(1050,plain,
is_a_theorem(or(not(or(not(not(X)),X)),or(Y,or(not(Z),X)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,1036,an_CAMerideth]) ).
cnf(1051,plain,
is_a_theorem(or(not(or(X,not(Y))),or(Z,or(U,or(X,not(Y)))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,1036,381]) ).
cnf(1164,plain,
is_a_theorem(or(X,or(not(not(Y)),or(not(Y),or(Z,U))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,385,381]) ).
cnf(1176,plain,
is_a_theorem(or(not(not(X)),or(not(X),or(Y,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,1164,6]) ).
cnf(1744,plain,
is_a_theorem(or(X,or(not(or(not(Y),or(Z,U))),or(or(not(or(Z,U)),V),or(Z,U))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,648,17]) ).
cnf(1748,plain,
is_a_theorem(or(X,or(not(or(not(Y),Z)),or(or(not(Y),Z),or(U,V))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,648,385]) ).
cnf(1856,plain,
is_a_theorem(or(not(or(not(X),or(Y,Z))),or(or(not(or(Y,Z)),U),or(Y,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,1744,6]) ).
cnf(1883,plain,
is_a_theorem(or(not(or(not(X),or(Y,Z))),or(U,or(or(not(or(Y,Z)),V),or(Y,Z))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,1856,10]) ).
cnf(2206,plain,
is_a_theorem(or(X,or(not(or(not(Y),Z)),or(U,or(not(Y),Z))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,1050,343]) ).
cnf(2976,plain,
is_a_theorem(or(not(or(not(X),Y)),or(Z,or(or(not(Y),not(U)),Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,1051,an_CAMerideth]) ).
cnf(3039,plain,
is_a_theorem(or(not(or(not(or(not(or(X,Y)),Z)),U)),or(V,or(or(X,Y),U)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,1883,an_CAMerideth]) ).
cnf(3252,plain,
is_a_theorem(or(X,or(or(Y,Z),or(not(U),or(V,U))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,3039,327]) ).
cnf(3318,plain,
is_a_theorem(or(or(X,Y),or(not(Z),or(U,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,3252,6]) ).
cnf(3870,plain,
~ is_a_theorem(or(not(X),or(b,a))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,13,343]) ).
cnf(3988,plain,
~ is_a_theorem(not(X)),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,3870,1176]) ).
cnf(4106,plain,
~ is_a_theorem(or(not(or(or(X,Y),or(not(Z),or(U,Z)))),not(V))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,3988,3318]) ).
cnf(5493,plain,
is_a_theorem(or(not(or(not(X),Y)),or(or(not(X),Y),or(Z,U)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,1748,6]) ).
cnf(5507,plain,
is_a_theorem(or(or(not(not(X)),or(not(X),or(Y,Z))),or(U,V))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,5493,1176]) ).
cnf(5515,plain,
is_a_theorem(or(or(not(or(not(X),Y)),or(not(Y),or(Z,Y))),or(U,V))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,5493,327]) ).
cnf(5769,plain,
is_a_theorem(or(not(or(not(X),Y)),or(Z,or(not(X),Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,2206,5507]) ).
cnf(5784,plain,
is_a_theorem(or(not(or(not(not(X)),X)),or(Y,or(Z,X)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,5769,an_CAMerideth]) ).
cnf(6612,plain,
is_a_theorem(or(not(or(not(X),not(Y))),or(Z,or(Y,not(Y))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,5784,an_CAMerideth]) ).
cnf(7212,plain,
is_a_theorem(or(not(or(not(or(not(X),not(Y))),Z)),or(U,or(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,2976,an_CAMerideth]) ).
cnf(13127,plain,
is_a_theorem(or(X,or(Y,or(Z,or(U,not(U)))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,7212,6612]) ).
cnf(14191,plain,
is_a_theorem(or(X,or(Y,or(Z,not(Z))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,13127,5515]) ).
cnf(14221,plain,
is_a_theorem(or(X,or(Y,not(Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,14191,5515]) ).
cnf(14247,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,14221,5515,4106]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : LCL004-1 : TPTP v8.1.0. Released v1.0.0.
% 0.02/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 3 11:15:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 *
% 0.18/0.45 *
% 0.18/0.46 #<PACKAGE "SNARK-USER">
% 0.18/0.46 *
% 0.18/0.46 SNARK-TPTP-OPTIONS
% 0.18/0.46 *
% 0.18/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46 (USE-FACTORING :POS)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46 *
% 0.18/0.46 "."
% 0.18/0.46 *
% 0.18/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T11:15:08
% 0.18/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n019.cluster.edu at 2022-07-03T11:15:08
% 11.21/11.39
% 11.21/11.39
% 11.21/11.39 #||
% 11.21/11.39 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.21/11.39 % SZS output start Refutation
% See solution above
% 11.21/11.42 ||#
% 11.21/11.42
% 11.21/11.42 ; Summary of computation:
% 11.21/11.42 ; 122483 formulas have been input or derived (from 420 formulas).
% 11.21/11.42 ; 14247 (12%) were retained. Of these,
% 11.21/11.42 ; 6018 (42%) were simplified or subsumed later,
% 11.21/11.42 ; 8229 (58%) are still being kept.
% 11.21/11.42 ;
% 11.21/11.42 ; Run time in seconds excluding printing time:
% 11.21/11.42 ; 0.001 0% Read assertion file (1 call)
% 11.21/11.42 ; 0.000 0% Assert (3 calls)
% 11.21/11.42 ; 2.192 20% Process new row (81,525 calls)
% 11.21/11.42 ; 6.089 56% Resolution (838 calls)
% 11.21/11.42 ; 0.433 4% Paramodulation (419 calls)
% 11.21/11.42 ; 0.000 0% Condensing (1 call)
% 11.21/11.42 ; 0.000 0% Forward subsumption (1 call)
% 11.21/11.42 ; 0.000 0% Backward subsumption (1 call)
% 11.21/11.42 ; 0.854 8% Forward simplification (81,232 calls)
% 11.21/11.42 ; 1.133 10% Backward simplification (14,247 calls)
% 11.21/11.42 ; 0.001 0% Sortal reasoning (32 calls)
% 11.21/11.42 ; 0.000 0% Purity testing (1 call)
% 11.21/11.42 ; 0.220 2% Other
% 11.21/11.42 ; 10.923 Total
% 11.21/11.42 ; 10.959 Real time
% 11.21/11.42 ;
% 11.21/11.42 ; Term-hash-array has 41,897 terms in all.
% 11.21/11.42 ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 11.21/11.42 ; Feature-vector-row-index has 6 nodes (6 at peak, 6 added, 0 deleted).
% 11.21/11.42 ; Retrieved 0 possibly forward subsuming rows in 1 call.
% 11.21/11.42 ; Retrieved 0 possibly backward subsumed rows in 1 call.
% 11.21/11.42 ; Path-index has 25,002 entries (25,224 at peak, 42,287 added, 17,285 deleted).
% 11.21/11.42 ; Path-index has 7,805 nodes (7,811 at peak, 8,469 added, 664 deleted).
% 11.21/11.42 ; Trie-index has 25,002 entries (25,224 at peak, 42,287 added, 17,285 deleted).
% 11.21/11.42 ; Trie-index has 101,174 nodes (101,703 at peak, 163,826 added, 62,652 deleted).
% 11.21/11.42 ; Retrieved 200,080 generalization terms in 81,236 calls.
% 11.21/11.42 ; Retrieved 74,877 instance terms in 14,245 calls.
% 11.21/11.42 ; Retrieved 4,878,166 unifiable terms in 64,116 calls.
% 11.21/11.42 ;
% 11.21/11.42 ; The agenda of rows to process has 352 entries:
% 11.21/11.42 ; 1 with value 29 47 with value 44 8 with value 53
% 11.21/11.42 ; 4 with value 34 39 with value 45 1 with value 54
% 11.21/11.42 ; 1 with value 37 18 with value 46 4 with value 56
% 11.21/11.42 ; 1 with value 38 59 with value 47 1 with value 57
% 11.21/11.42 ; 1 with value 39 20 with value 48 2 with value 58
% 11.21/11.42 ; 12 with value 40 14 with value 49 1 with value 59
% 11.21/11.42 ; 24 with value 41 32 with value 50 2 with value 60
% 11.21/11.42 ; 20 with value 42 10 with value 51 6 with value 61
% 11.21/11.42 ; 15 with value 43 8 with value 52 1 with value 62
% 11.21/11.42 ; The agenda of rows to give has 7965 entries:
% 11.21/11.42 ; 4 with value (4 40) 194 with value (4 55) 151 with value (4 69)
% 11.21/11.42 ; 10 with value (4 41) 255 with value (4 56) 117 with value (4 70)
% 11.21/11.42 ; 6 with value (4 42) 225 with value (4 57) 81 with value (4 71)
% 11.21/11.42 ; 45 with value (4 43) 247 with value (4 58) 60 with value (4 72)
% 11.21/11.42 ; 121 with value (4 44) 256 with value (4 59) 40 with value (4 73)
% 11.21/11.42 ; 123 with value (4 45) 339 with value (4 60) 34 with value (4 74)
% 11.21/11.42 ; 157 with value (4 46) 388 with value (4 61) 38 with value (4 75)
% 11.21/11.42 ; 183 with value (4 47) 492 with value (4 62) 29 with value (4 76)
% 11.21/11.42 ; 211 with value (4 48) 534 with value (4 63) 24 with value (4 77)
% 11.21/11.42 ; 232 with value (4 49) 578 with value (4 64) 14 with value (4 78)
% 11.21/11.42 ; 272 with value (4 50) 500 with value (4 65) 6 with value (4 79)
% 11.21/11.42 ; 291 with value (4 51) 525 with value (4 66) 2 with value (4 82)
% 11.21/11.42 ; 259 with value (4 52) 228 with value (4 67) 1 with value (4 83)
% 11.21/11.42 ; 267 with value (4 53) 158 with value (4 68) 1 with value (4 87)
% 11.21/11.42 ; 267 with value (4 54)
% 11.21/11.42 Evaluation took:
% 11.21/11.42 10.961 seconds of real time
% 11.21/11.42 10.427406 seconds of user run time
% 11.21/11.42 0.526184 seconds of system run time
% 11.21/11.42 [Run times include 1.443 seconds GC run time.]
% 11.21/11.42 0 calls to %EVAL
% 11.21/11.42 0 page faults and
% 11.21/11.42 686,097,864 bytes consed.
% 11.21/11.42 :PROOF-FOUND
% 11.21/11.42 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T11:15:19
% 11.21/11.42 :PROOF-FOUND
% 11.21/11.42 *
%------------------------------------------------------------------------------