TSTP Solution File: LCL123-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL123-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n015.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:20:23 EDT 2022
% Result : Unsatisfiable 14.95s 15.19s
% Output : Refutation 15.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of clauses : 25 ( 24 unt; 0 nHn; 3 RR)
% Number of literals : 27 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 84 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(equivalent(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(lg_2,axiom,
is_a_theorem(equivalent(X,equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Y,U),equivalent(Z,U)))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_2) ).
cnf(prove_lg_4,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),equivalent(e,equivalent(b,f))),equivalent(a,equivalent(e,equivalent(c,f))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lg_4) ).
cnf(4,plain,
is_a_theorem(equivalent(equivalent(X,equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Y,U),equivalent(Z,U))))),equivalent(equivalent(V,W),equivalent(equivalent(V,X1),equivalent(W,X1))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,lg_2,lg_2]) ).
cnf(6,plain,
is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,Z),equivalent(Y,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,4,lg_2]) ).
cnf(9,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(equivalent(X,U),equivalent(Y,U)),Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,6,6]) ).
cnf(14,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(equivalent(X,U),equivalent(Z,U)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,9,6]) ).
cnf(16,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),U),equivalent(equivalent(equivalent(equivalent(X,V),equivalent(Y,V)),Z),U))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,9,6]) ).
cnf(21,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(X,Y),Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,14,14]) ).
cnf(24,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(U,Z))),V),equivalent(equivalent(X,equivalent(Y,U)),V))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,14,4]) ).
cnf(27,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(U,Z)),equivalent(equivalent(X,Y),U))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,21,9]) ).
cnf(30,plain,
is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,27,14]) ).
cnf(31,plain,
is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(U,Z))),equivalent(X,equivalent(Y,U)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,27,4]) ).
cnf(37,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(X,Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,30,9]) ).
cnf(40,plain,
is_a_theorem(equivalent(X,X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,37,30]) ).
cnf(42,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),U),equivalent(equivalent(X,Z),U))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,37,6]) ).
cnf(83,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(U,Z)),equivalent(equivalent(X,V),equivalent(U,V)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,16,14]) ).
cnf(126,plain,
is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(X,equivalent(U,Z)),equivalent(Y,U)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,42,31]) ).
cnf(138,plain,
is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,equivalent(Z,Z)),Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,83,31]) ).
cnf(147,plain,
is_a_theorem(equivalent(equivalent(X,equivalent(Y,Y)),X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,138,40]) ).
cnf(210,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Y)),Z),equivalent(X,Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,147,14]) ).
cnf(1098,plain,
is_a_theorem(equivalent(X,equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,126,210]) ).
cnf(1127,plain,
is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(X,equivalent(U,equivalent(Z,V))),equivalent(equivalent(Y,V),U)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,126,24]) ).
cnf(1153,plain,
is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(Z,U))),equivalent(equivalent(X,equivalent(U,Z)),Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,1098,126]) ).
cnf(10230,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[condensed_detachment,1153,prove_lg_4]),1127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL123-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jul 2 14:16:14 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 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.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-02T14:16:14
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n015.cluster.edu at 2022-07-02T14:16:14
% 14.95/15.19
% 14.95/15.19
% 14.95/15.19 #||
% 14.95/15.19 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.95/15.19 % SZS output start Refutation
% See solution above
% 15.04/15.21 ||#
% 15.04/15.21
% 15.04/15.21 ; Summary of computation:
% 15.04/15.21 ; 69944 formulas have been input or derived (from 223 formulas).
% 15.04/15.21 ; 10230 (15%) were retained. Of these,
% 15.04/15.21 ; 11 ( 0%) were simplified or subsumed later,
% 15.04/15.21 ; 10219 (100%) are still being kept.
% 15.04/15.21 ;
% 15.04/15.21 ; Run time in seconds excluding printing time:
% 15.04/15.21 ; 0.001 0% Read assertion file (1 call)
% 15.04/15.21 ; 0.000 0% Assert (3 calls)
% 15.04/15.21 ; 1.278 9% Process new row (60,997 calls)
% 15.04/15.21 ; 10.027 68% Resolution (444 calls)
% 15.04/15.21 ; 0.557 4% Paramodulation (222 calls)
% 15.04/15.21 ; 0.001 0% Condensing (1 call)
% 15.04/15.21 ; 0.000 0% Forward subsumption (1 call)
% 15.04/15.21 ; 0.000 0% Backward subsumption (1 call)
% 15.04/15.21 ; 1.305 9% Forward simplification (60,991 calls)
% 15.04/15.21 ; 1.355 9% Backward simplification (10,230 calls)
% 15.04/15.21 ; 0.000 0% Sortal reasoning (32 calls)
% 15.04/15.21 ; 0.000 0% Purity testing (1 call)
% 15.04/15.21 ; 0.196 1% Other
% 15.04/15.21 ; 14.720 Total
% 15.04/15.21 ; 14.739 Real time
% 15.04/15.21 ;
% 15.04/15.21 ; Term-hash-array has 30,643 terms in all.
% 15.04/15.21 ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 15.04/15.21 ; Feature-vector-row-index has 4 nodes (4 at peak, 4 added, 0 deleted).
% 15.04/15.21 ; Retrieved 0 possibly forward subsuming rows in 1 call.
% 15.04/15.21 ; Retrieved 0 possibly backward subsumed rows in 1 call.
% 15.04/15.21 ; Path-index has 30,626 entries (30,626 at peak, 30,655 added, 29 deleted).
% 15.04/15.21 ; Path-index has 2,005 nodes (2,005 at peak, 2,009 added, 4 deleted).
% 15.04/15.21 ; Trie-index has 30,626 entries (30,626 at peak, 30,655 added, 29 deleted).
% 15.04/15.21 ; Trie-index has 58,523 nodes (58,523 at peak, 58,740 added, 217 deleted).
% 15.04/15.21 ; Retrieved 731,190 generalization terms in 60,993 calls.
% 15.04/15.21 ; Retrieved 217,847 instance terms in 10,228 calls.
% 15.04/15.21 ; Retrieved 8,447,578 unifiable terms in 38,352 calls.
% 15.04/15.21 ;
% 15.04/15.21 ; The agenda of rows to process has 296 entries:
% 15.04/15.21 ; 56 with value 40 70 with value 45 1 with value 49
% 15.04/15.21 ; 94 with value 41 22 with value 46 8 with value 50
% 15.04/15.21 ; 6 with value 43 4 with value 48 1 with value 56
% 15.04/15.21 ; 34 with value 44
% 15.04/15.21 ; The agenda of rows to give has 9999 entries:
% 15.04/15.21 ; 27 with value (4 34) 1581 with value (4 44) 104 with value (4 53)
% 15.04/15.21 ; 140 with value (4 35) 1594 with value (4 45) 65 with value (4 54)
% 15.04/15.21 ; 161 with value (4 36) 532 with value (4 46) 46 with value (4 55)
% 15.04/15.21 ; 157 with value (4 37) 267 with value (4 47) 87 with value (4 56)
% 15.04/15.21 ; 356 with value (4 38) 407 with value (4 48) 8 with value (4 57)
% 15.04/15.21 ; 755 with value (4 39) 450 with value (4 49) 13 with value (4 58)
% 15.04/15.21 ; 873 with value (4 40) 344 with value (4 50) 5 with value (4 59)
% 15.04/15.21 ; 530 with value (4 41) 54 with value (4 51) 1 with value (4 62)
% 15.04/15.21 ; 531 with value (4 42) 50 with value (4 52) 3 with value (4 63)
% 15.04/15.21 ; 858 with value (4 43)
% 15.04/15.21 Evaluation took:
% 15.04/15.21 14.74 seconds of real time
% 15.04/15.21 14.38168 seconds of user run time
% 15.04/15.21 0.357975 seconds of system run time
% 15.04/15.21 [Run times include 0.909 seconds GC run time.]
% 15.04/15.21 0 calls to %EVAL
% 15.04/15.21 0 page faults and
% 15.04/15.21 517,276,104 bytes consed.
% 15.04/15.21 :PROOF-FOUND
% 15.04/15.21 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-02T14:16:29
% 15.04/15.21 :PROOF-FOUND
% 15.04/15.21 *
%------------------------------------------------------------------------------