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

View Problem - Process Solution

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

% Computer : n021.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.55s 0.75s
% Output   : Refutation 0.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   20 (  20 unt;   0 nHn;   6 RR)
%            Number of literals    :   20 (  19 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   :   24 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(wajsberg_1,axiom,
    implies(truth,X) = X,
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/LCL001-0.ax',wajsberg_2) ).

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

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

cnf(and_definition,axiom,
    and(X,Y) = not(or(not(X),not(Y))),
    file('/export/starexec/sandbox2/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(xor_definition,axiom,
    xor(X,Y) = or(and(X,not(Y)),and(not(X),Y)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-1.ax',xor_definition) ).

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

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

cnf(prove_alternative_wajsberg_axiom,negated_conjecture,
    xor(x,x) != falsehood,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_alternative_wajsberg_axiom) ).

cnf(16,plain,
    implies(not(and(x,not(x))),and(x,not(x))) != falsehood,
    inference('REWRITE',[status(thm)],[prove_alternative_wajsberg_axiom,10,theory(equality)]) ).

cnf(17,plain,
    implies(not(X),Y) = implies(not(Y),X),
    inference('PARAMODULATE',[status(thm)],[or_definition,or_definition,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(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(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(181,plain,
    and(X,not(X)) = falsehood,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,160,theory(equality)]),false_definition,theory(equality)]) ).

cnf(183,plain,
    implies(not(falsehood),falsehood) != falsehood,
    inference('REWRITE',[status(thm)],[16,181,theory(equality)]) ).

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

cnf(204,plain,
    $false,
    inference('REWRITE',[status(thm)],[183,wajsberg_1,201,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : LCL155-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.14  % Command  : run-snark %s %d
% 0.13/0.35  % Computer : n021.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun Jul  3 23:14:01 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-03T23:14:01
% 0.20/0.49  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-07-03T23:14:01
% 0.20/0.50  
% 0.20/0.50  ; Recognized left identity assertion (= (|implies| |truth| ?X) ?X).
% 0.20/0.50  ; Recognized associativity assertion (= (|or| (|or| ?X ?Y) ?Z) (|or| ?X (|or| ?Y ?Z))).
% 0.20/0.50  ; Recognized commutativity assertion (= (|or| ?X ?Y) (|or| ?Y ?X)).
% 0.20/0.50  ; Recognized associativity assertion (= (|and| (|and| ?X ?Y) ?Z) (|and| ?X (|and| ?Y ?Z))).
% 0.20/0.50  ; Recognized commutativity assertion (= (|and| ?X ?Y) (|and| ?Y ?X)).
% 0.20/0.50  ; Recognized commutativity assertion (= (|xor| ?X ?Y) (|xor| ?Y ?X)).
% 0.20/0.50  ; Recognized associativity assertion (= (|and_star| (|and_star| ?X ?Y) ?Z) (|and_star| ?X (|and_star| ?Y ?Z))).
% 0.20/0.50  ; Recognized commutativity assertion (= (|and_star| ?X ?Y) (|and_star| ?Y ?X)).
% 0.20/0.50  ; Declaring or to be commutative.
% 0.20/0.50  ; Declaring or to be associative-commutative.
% 0.20/0.50  ; Declaring and to be commutative.
% 0.20/0.50  ; Declaring and to be associative-commutative.
% 0.20/0.50  ; Declaring xor to be commutative.
% 0.20/0.50  ; Declaring and_star to be commutative.
% 0.55/0.75  ; Declaring and_star to be associative-commutative.
% 0.55/0.75  
% 0.55/0.75  #||
% 0.55/0.75  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.75  % SZS output start Refutation
% See solution above
% 0.55/0.75  ||#
% 0.55/0.75  
% 0.55/0.75  ; Summary of computation:
% 0.55/0.75  ;       633 formulas have been input or derived (from 30 formulas).
% 0.55/0.75  ;       204 (32%) were retained.  Of these,
% 0.55/0.75  ;           58 (28%) were simplified or subsumed later,
% 0.55/0.75  ;          146 (72%) are still being kept.
% 0.55/0.75  ; 
% 0.55/0.75  ; Run time in seconds excluding printing time:
% 0.55/0.75  ;     0.004   2%   Read assertion file          (1 call)
% 0.55/0.75  ;     0.001   0%   Assert                       (17 calls)
% 0.55/0.75  ;     0.018   7%   Process new row              (587 calls)
% 0.55/0.75  ;     0.002   1%   Resolution                   (58 calls)
% 0.55/0.75  ;     0.013   5%   Paramodulation               (29 calls)
% 0.55/0.75  ;     0.000   0%   Embedding                    (13 calls)
% 0.55/0.75  ;     0.080  30%   Forward simplification       (574 calls)
% 0.55/0.75  ;     0.021   8%   Backward simplification      (191 calls)
% 0.55/0.75  ;     0.103  39%   Ordering                     (14,109 calls)
% 0.55/0.75  ;     0.000   0%   Ordering ac                  (45 calls)
% 0.55/0.75  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.55/0.75  ;     0.000   0%   Purity testing               (1 call)
% 0.55/0.75  ;     0.023   9%   Other
% 0.55/0.75  ;     0.265        Total
% 0.55/0.75  ;     0.266        Real time
% 0.55/0.75  ; 
% 0.55/0.75  ; Term-hash-array has 770 terms in all.
% 0.55/0.75  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.55/0.75  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.55/0.75  ; Path-index has 623 entries (674 at peak, 782 added, 159 deleted).
% 0.55/0.75  ; Path-index has 591 nodes (674 at peak, 708 added, 117 deleted).
% 0.55/0.75  ; Trie-index has 623 entries (674 at peak, 782 added, 159 deleted).
% 0.55/0.75  ; Trie-index has 1,472 nodes (1,836 at peak, 2,024 added, 552 deleted).
% 0.55/0.75  ; Retrieved 9,943 generalization terms in 5,446 calls.
% 0.55/0.75  ; Retrieved 1,785 instance terms in 333 calls.
% 0.55/0.75  ; Retrieved 2,185 unifiable terms in 164 calls.
% 0.55/0.75  ; 
% 0.55/0.75  ; The agenda of rows to process has 12 entries:
% 0.55/0.75  ;     2 with value 15              1 with value 18               2 with value 22
% 0.55/0.75  ;     2 with value 16              1 with value 21               3 with value 23
% 0.55/0.75  ;     1 with value 17
% 0.55/0.75  ; The agenda of rows to give has 125 entries:
% 0.55/0.75  ;     1 with value (4 9)          13 with value (4 21)          11 with value (4 36)
% 0.55/0.75  ;     2 with value (4 11)          4 with value (4 22)           6 with value (4 37)
% 0.55/0.75  ;     2 with value (4 14)          9 with value (4 23)           6 with value (4 42)
% 0.55/0.75  ;     2 with value (4 16)          2 with value (4 24)           7 with value (4 43)
% 0.55/0.75  ;     5 with value (4 17)          1 with value (4 27)           3 with value (4 44)
% 0.55/0.75  ;     2 with value (4 18)         10 with value (4 28)           2 with value (4 49)
% 0.55/0.75  ;     2 with value (4 19)         15 with value (4 29)           3 with value (4 50)
% 0.55/0.75  ;     5 with value (4 20)         11 with value (4 35)           1 with value (4 56)
% 0.55/0.75  Evaluation took:
% 0.55/0.75    0.268 seconds of real time
% 0.55/0.75    0.24003 seconds of user run time
% 0.55/0.75    0.027306 seconds of system run time
% 0.55/0.75    [Run times include 0.006 seconds GC run time.]
% 0.55/0.75    0 calls to %EVAL
% 0.55/0.75    0 page faults and
% 0.55/0.75    15,312,696 bytes consed.
% 0.55/0.75  :PROOF-FOUND
% 0.55/0.75  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-03T23:14:01
% 0.55/0.75  :PROOF-FOUND
% 0.55/0.75  * 
%------------------------------------------------------------------------------