TSTP Solution File: LCL156-1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : LCL156-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n014.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:37 EDT 2022

% Result   : Unsatisfiable 0.56s 0.76s
% Output   : Refutation 0.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   31 (  31 unt;   0 nHn;   6 RR)
%            Number of literals    :   31 (  30 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   36 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(wajsberg_1,axiom,
    implies(truth,X) = X,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).

cnf(wajsberg_2,axiom,
    implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))) = truth,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).

cnf(wajsberg_3,axiom,
    implies(implies(X,Y),Y) = implies(implies(Y,X),X),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).

cnf(wajsberg_4,axiom,
    implies(implies(not(X),not(Y)),implies(Y,X)) = truth,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).

cnf(or_definition,axiom,
    or(X,Y) = implies(not(X),Y),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_definition) ).

cnf(and_definition,axiom,
    and(X,Y) = not(or(not(X),not(Y))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',and_definition) ).

cnf(8,plain,
    and(X,Y) = not(implies(not(not(X)),not(Y))),
    inference('REWRITE',[status(thm)],[and_definition,or_definition,theory(equality)]) ).

cnf(and_star_definition,axiom,
    and_star(X,Y) = not(or(not(X),not(Y))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',and_star_definition) ).

cnf(12,plain,
    and_star(X,Y) = and(X,Y),
    inference('REWRITE',[status(thm)],[and_star_definition,8,or_definition,theory(equality)]) ).

cnf(false_definition,axiom,
    not(truth) = falsehood,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',false_definition) ).

cnf(prove_alternative_wajsberg_axiom,negated_conjecture,
    and_star(x,truth) != x,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_alternative_wajsberg_axiom) ).

cnf(16,plain,
    and(x,truth) != x,
    inference('REWRITE',[status(thm)],[prove_alternative_wajsberg_axiom,12,theory(equality)]) ).

cnf(17,plain,
    implies(not(X),Y) = implies(not(Y),X),
    inference('PARAMODULATE',[status(thm)],[or_definition,or_definition,theory(equality)]) ).

cnf(99,plain,
    implies(X,X) = implies(implies(X,truth),truth),
    inference('PARAMODULATE',[status(thm)],[wajsberg_3,wajsberg_1,theory(equality)]) ).

cnf(101,plain,
    implies(implies(not(X),falsehood),X) = truth,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wajsberg_4,wajsberg_1,theory(equality)]),false_definition,theory(equality)]) ).

cnf(105,plain,
    and(truth,X) = not(implies(not(falsehood),not(X))),
    inference('PARAMODULATE',[status(thm)],[8,false_definition,theory(equality)]) ).

cnf(111,plain,
    implies(X,implies(implies(X,Y),Y)) = truth,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wajsberg_2,wajsberg_1,theory(equality)]),wajsberg_1,theory(equality)]) ).

cnf(125,plain,
    implies(falsehood,X) = implies(not(X),truth),
    inference('PARAMODULATE',[status(thm)],[17,false_definition,theory(equality)]) ).

cnf(134,plain,
    implies(not(X),not(X)) = implies(implies(falsehood,X),truth),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[99,17,theory(equality)]),false_definition,theory(equality)]) ).

cnf(140,plain,
    implies(implies(not(falsehood),X),X) = truth,
    inference('PARAMODULATE',[status(thm)],[101,17,theory(equality)]) ).

cnf(160,plain,
    truth = implies(X,X),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wajsberg_1,111,theory(equality)]),wajsberg_1,theory(equality)]) ).

cnf(161,plain,
    truth = implies(implies(falsehood,X),truth),
    inference('REWRITE',[status(thm)],[134,160,theory(equality)]) ).

cnf(167,plain,
    implies(falsehood,X) = truth,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[111,125,theory(equality)]),125,161,theory(equality)]) ).

cnf(183,plain,
    X = implies(implies(X,falsehood),falsehood),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wajsberg_3,167,theory(equality)]),wajsberg_1,theory(equality)]) ).

cnf(200,plain,
    not(falsehood) = truth,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[140,160,theory(equality)]),wajsberg_1,theory(equality)]) ).

cnf(201,plain,
    and(truth,X) = not(not(X)),
    inference('REWRITE',[status(thm)],[105,wajsberg_1,200,theory(equality)]) ).

cnf(203,plain,
    not(not(x)) != x,
    inference('REWRITE',[status(thm)],[16,201,theory(equality)]) ).

cnf(204,plain,
    X = implies(not(X),falsehood),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[17,200,theory(equality)]),wajsberg_1,theory(equality)]) ).

cnf(212,plain,
    implies(X,falsehood) = not(X),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wajsberg_3,204,theory(equality)]),wajsberg_1,167,theory(equality)]) ).

cnf(213,plain,
    X = not(not(X)),
    inference('REWRITE',[status(thm)],[183,212,theory(equality)]) ).

cnf(221,plain,
    $false,
    inference('REWRITE',[status(thm)],[203,213,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL156-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n014.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 11:33:24 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47  * 
% 0.19/0.47  * 
% 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/sandbox/benchmark/theBenchmark.p 2022-07-03T11:33:24
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-07-03T11:33:24
% 0.19/0.49  
% 0.19/0.49  ; Recognized left identity assertion (= (|implies| |truth| ?X) ?X).
% 0.19/0.49  ; Recognized associativity assertion (= (|or| (|or| ?X ?Y) ?Z) (|or| ?X (|or| ?Y ?Z))).
% 0.19/0.49  ; Recognized commutativity assertion (= (|or| ?X ?Y) (|or| ?Y ?X)).
% 0.19/0.49  ; Recognized associativity assertion (= (|and| (|and| ?X ?Y) ?Z) (|and| ?X (|and| ?Y ?Z))).
% 0.19/0.49  ; Recognized commutativity assertion (= (|and| ?X ?Y) (|and| ?Y ?X)).
% 0.19/0.49  ; Recognized commutativity assertion (= (|xor| ?X ?Y) (|xor| ?Y ?X)).
% 0.19/0.49  ; Recognized associativity assertion (= (|and_star| (|and_star| ?X ?Y) ?Z) (|and_star| ?X (|and_star| ?Y ?Z))).
% 0.19/0.49  ; Recognized commutativity assertion (= (|and_star| ?X ?Y) (|and_star| ?Y ?X)).
% 0.19/0.49  ; Declaring or to be commutative.
% 0.19/0.49  ; Declaring or to be associative-commutative.
% 0.19/0.49  ; Declaring and to be commutative.
% 0.19/0.49  ; Declaring and to be associative-commutative.
% 0.19/0.49  ; Declaring xor to be commutative.
% 0.19/0.49  ; Declaring and_star to be commutative.
% 0.56/0.76  ; Declaring and_star to be associative-commutative.
% 0.56/0.76  
% 0.56/0.76  #||
% 0.56/0.76  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.56/0.76  % SZS output start Refutation
% See solution above
% 0.60/0.76  ||#
% 0.60/0.76  
% 0.60/0.76  ; Summary of computation:
% 0.60/0.76  ;       765 formulas have been input or derived (from 36 formulas).
% 0.60/0.76  ;       221 (29%) were retained.  Of these,
% 0.60/0.76  ;           88 (40%) were simplified or subsumed later,
% 0.60/0.76  ;          133 (60%) are still being kept.
% 0.60/0.76  ; 
% 0.60/0.76  ; Run time in seconds excluding printing time:
% 0.60/0.76  ;     0.004   1%   Read assertion file          (1 call)
% 0.60/0.76  ;     0.000   0%   Assert                       (17 calls)
% 0.60/0.76  ;     0.035  12%   Process new row              (713 calls)
% 0.60/0.76  ;     0.000   0%   Resolution                   (70 calls)
% 0.60/0.76  ;     0.016   6%   Paramodulation               (35 calls)
% 0.60/0.76  ;     0.001   0%   Embedding                    (19 calls)
% 0.60/0.76  ;     0.065  23%   Forward simplification       (686 calls)
% 0.60/0.76  ;     0.019   7%   Backward simplification      (206 calls)
% 0.60/0.76  ;     0.120  42%   Ordering                     (14,229 calls)
% 0.60/0.76  ;     0.000   0%   Ordering ac                  (78 calls)
% 0.60/0.76  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.60/0.76  ;     0.000   0%   Purity testing               (1 call)
% 0.60/0.76  ;     0.025   9%   Other
% 0.60/0.76  ;     0.285        Total
% 0.60/0.76  ;     0.288        Real time
% 0.60/0.76  ; 
% 0.60/0.76  ; Term-hash-array has 807 terms in all.
% 0.60/0.76  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.60/0.76  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.60/0.76  ; Path-index has 574 entries (671 at peak, 828 added, 254 deleted).
% 0.60/0.76  ; Path-index has 580 nodes (664 at peak, 751 added, 171 deleted).
% 0.60/0.76  ; Trie-index has 574 entries (671 at peak, 828 added, 254 deleted).
% 0.60/0.76  ; Trie-index has 1,362 nodes (1,833 at peak, 2,110 added, 748 deleted).
% 0.60/0.76  ; Retrieved 11,114 generalization terms in 6,258 calls.
% 0.60/0.76  ; Retrieved 1,818 instance terms in 348 calls.
% 0.60/0.76  ; Retrieved 2,413 unifiable terms in 190 calls.
% 0.60/0.76  ; 
% 0.60/0.76  ; The agenda of backward simplifiable rows to process has 4 entries:
% 0.60/0.76  ;     4 with value 0
% 0.60/0.76  ; The agenda of rows to process has 6 entries:
% 0.60/0.76  ;     2 with value 20              3 with value 21               1 with value 22
% 0.60/0.76  ; The agenda of input rows to give has 1 entry:
% 0.60/0.76  ;     1 with value 13
% 0.60/0.76  ; The agenda of rows to give has 110 entries:
% 0.60/0.76  ;     1 with value (4 8)           4 with value (4 20)          11 with value (4 36)
% 0.60/0.76  ;     1 with value (4 12)         10 with value (4 21)           6 with value (4 37)
% 0.60/0.76  ;     1 with value (4 13)          3 with value (4 22)           6 with value (4 42)
% 0.60/0.76  ;     1 with value (4 14)          5 with value (4 23)           7 with value (4 43)
% 0.60/0.76  ;     1 with value (4 16)          1 with value (4 27)           3 with value (4 44)
% 0.60/0.76  ;     3 with value (4 17)         10 with value (4 28)           2 with value (4 49)
% 0.60/0.76  ;     3 with value (4 18)         15 with value (4 29)           3 with value (4 50)
% 0.60/0.76  ;     1 with value (4 19)         11 with value (4 35)           1 with value (4 56)
% 0.60/0.76  Evaluation took:
% 0.60/0.76    0.288 seconds of real time
% 0.60/0.76    0.251907 seconds of user run time
% 0.60/0.76    0.036511 seconds of system run time
% 0.60/0.76    [Run times include 0.006 seconds GC run time.]
% 0.60/0.76    0 calls to %EVAL
% 0.60/0.76    0 page faults and
% 0.60/0.76    16,662,376 bytes consed.
% 0.60/0.76  :PROOF-FOUND
% 0.60/0.76  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T11:33:25
% 0.60/0.76  :PROOF-FOUND
% 0.60/0.76  * 
%------------------------------------------------------------------------------