TSTP Solution File: LCL128-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL128-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:20:25 EDT 2022
% Result : Unsatisfiable 0.78s 1.02s
% Output : Refutation 0.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of clauses : 24 ( 23 unt; 0 nHn; 4 RR)
% Number of literals : 26 ( 0 equ; 4 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(equivalent(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(s_3,axiom,
is_a_theorem(equivalent(X,equivalent(X,equivalent(equivalent(equivalent(Y,Z),equivalent(U,Z)),equivalent(Y,U))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s_3) ).
cnf(prove_lg_2,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_2) ).
cnf(4,plain,
is_a_theorem(equivalent(equivalent(X,equivalent(X,equivalent(equivalent(equivalent(Y,Z),equivalent(U,Z)),equivalent(Y,U)))),equivalent(equivalent(equivalent(V,W),equivalent(X1,W)),equivalent(V,X1)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,s_3,s_3]) ).
cnf(6,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(X,Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,4,s_3]) ).
cnf(10,plain,
~ is_a_theorem(equivalent(equivalent(a,X),equivalent(equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),X))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,6,prove_lg_2]) ).
cnf(11,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(X,Z)),equivalent(equivalent(equivalent(U,V),equivalent(W,V)),equivalent(U,W)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,6,s_3]) ).
cnf(25,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,11,6]) ).
cnf(30,plain,
is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,25,6]) ).
cnf(32,plain,
is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,equivalent(equivalent(equivalent(Z,U),equivalent(V,U)),equivalent(Z,V))),Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,25,s_3]) ).
cnf(39,plain,
is_a_theorem(equivalent(X,X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,30,6]) ).
cnf(40,plain,
is_a_theorem(equivalent(equivalent(X,X),equivalent(equivalent(equivalent(Y,Z),equivalent(U,Z)),equivalent(Y,U)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,39,s_3]) ).
cnf(44,plain,
is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,Z),equivalent(Y,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,40,6]) ).
cnf(50,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,44,6]) ).
cnf(182,plain,
is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,Z),equivalent(U,Z)),equivalent(Y,U))),X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,32,39]) ).
cnf(207,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,182,50]) ).
cnf(242,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(U,Z)),equivalent(X,U))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,207,50]) ).
cnf(246,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,207,50]) ).
cnf(293,plain,
is_a_theorem(equivalent(X,equivalent(X,equivalent(Y,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,242,207]) ).
cnf(313,plain,
is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,equivalent(Z,Z)),Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,293,25]) ).
cnf(374,plain,
is_a_theorem(equivalent(equivalent(X,equivalent(Y,Y)),X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,313,39]) ).
cnf(410,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Y)),Z),equivalent(X,Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,374,25]) ).
cnf(729,plain,
is_a_theorem(equivalent(X,equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,410,246]) ).
cnf(1114,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,729,32,10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL128-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/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 : Mon Jul 4 06:12:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 *
% 0.18/0.46 *
% 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-04T06:12:53
% 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-04T06:12:53
% 0.78/1.02
% 0.78/1.02
% 0.78/1.02 #||
% 0.78/1.02 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.78/1.02 % SZS output start Refutation
% See solution above
% 0.85/1.02 ||#
% 0.85/1.02
% 0.85/1.02 ; Summary of computation:
% 0.85/1.02 ; 4705 formulas have been input or derived (from 60 formulas).
% 0.85/1.02 ; 1114 (24%) were retained. Of these,
% 0.85/1.02 ; 1 ( 0%) were simplified or subsumed later,
% 0.85/1.02 ; 1113 (100%) are still being kept.
% 0.85/1.02 ;
% 0.85/1.02 ; Run time in seconds excluding printing time:
% 0.85/1.02 ; 0.001 0% Read assertion file (1 call)
% 0.85/1.02 ; 0.000 0% Assert (3 calls)
% 0.85/1.02 ; 0.134 24% Process new row (3,955 calls)
% 0.85/1.02 ; 0.220 40% Resolution (118 calls)
% 0.85/1.02 ; 0.013 2% Paramodulation (59 calls)
% 0.85/1.02 ; 0.000 0% Condensing (1 call)
% 0.85/1.02 ; 0.000 0% Forward subsumption (1 call)
% 0.85/1.02 ; 0.001 0% Backward subsumption (1 call)
% 0.85/1.02 ; 0.056 10% Forward simplification (3,935 calls)
% 0.85/1.02 ; 0.091 16% Backward simplification (1,114 calls)
% 0.85/1.02 ; 0.000 0% Sortal reasoning (32 calls)
% 0.85/1.02 ; 0.000 0% Purity testing (1 call)
% 0.85/1.02 ; 0.036 7% Other
% 0.85/1.02 ; 0.552 Total
% 0.85/1.02 ; 0.554 Real time
% 0.85/1.02 ;
% 0.85/1.02 ; Term-hash-array has 3,477 terms in all.
% 0.85/1.02 ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 0.85/1.02 ; Feature-vector-row-index has 4 nodes (4 at peak, 4 added, 0 deleted).
% 0.85/1.02 ; Retrieved 0 possibly forward subsuming rows in 1 call.
% 0.85/1.02 ; Retrieved 0 possibly backward subsumed rows in 1 call.
% 0.85/1.02 ; Path-index has 3,479 entries (3,479 at peak, 3,481 added, 2 deleted).
% 0.85/1.02 ; Path-index has 1,445 nodes (1,445 at peak, 1,445 added, 0 deleted).
% 0.85/1.02 ; Trie-index has 3,479 entries (3,479 at peak, 3,481 added, 2 deleted).
% 0.85/1.02 ; Trie-index has 14,995 nodes (14,995 at peak, 14,997 added, 2 deleted).
% 0.85/1.02 ; Retrieved 20,416 generalization terms in 3,933 calls.
% 0.85/1.02 ; Retrieved 17,314 instance terms in 1,112 calls.
% 0.85/1.02 ; Retrieved 237,890 unifiable terms in 3,151 calls.
% 0.85/1.02 ;
% 0.85/1.02 ; The agenda of rows to process has 176 entries:
% 0.85/1.02 ; 4 with value 23 22 with value 43 7 with value 52
% 0.85/1.02 ; 1 with value 29 40 with value 44 1 with value 53
% 0.85/1.02 ; 6 with value 33 4 with value 45 4 with value 54
% 0.85/1.02 ; 6 with value 34 1 with value 46 1 with value 55
% 0.85/1.02 ; 8 with value 38 10 with value 47 1 with value 56
% 0.85/1.02 ; 22 with value 39 30 with value 48 1 with value 57
% 0.85/1.02 ; 1 with value 40 4 with value 49 1 with value 62
% 0.85/1.02 ; 1 with value 42
% 0.85/1.02 ; The agenda of rows to give has 1054 entries:
% 0.85/1.02 ; 3 with value (4 33) 89 with value (4 43) 17 with value (4 52)
% 0.85/1.02 ; 14 with value (4 34) 46 with value (4 44) 11 with value (4 53)
% 0.85/1.02 ; 19 with value (4 35) 52 with value (4 45) 12 with value (4 54)
% 0.85/1.02 ; 54 with value (4 36) 68 with value (4 46) 12 with value (4 55)
% 0.85/1.02 ; 83 with value (4 37) 29 with value (4 47) 23 with value (4 56)
% 0.85/1.02 ; 101 with value (4 38) 30 with value (4 48) 2 with value (4 57)
% 0.85/1.02 ; 55 with value (4 39) 35 with value (4 49) 2 with value (4 58)
% 0.85/1.02 ; 31 with value (4 40) 37 with value (4 50) 1 with value (4 59)
% 0.85/1.02 ; 82 with value (4 41) 65 with value (4 51) 2 with value (4 60)
% 0.85/1.02 ; 79 with value (4 42)
% 0.85/1.02 Evaluation took:
% 0.85/1.02 0.555 seconds of real time
% 0.85/1.02 0.521564 seconds of user run time
% 0.85/1.02 0.032785 seconds of system run time
% 0.85/1.02 [Run times include 0.02 seconds GC run time.]
% 0.85/1.02 0 calls to %EVAL
% 0.85/1.02 0 page faults and
% 0.85/1.02 36,210,824 bytes consed.
% 0.85/1.02 :PROOF-FOUND
% 0.85/1.02 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T06:12:54
% 0.85/1.02 :PROOF-FOUND
% 0.85/1.02 *
%------------------------------------------------------------------------------