TSTP Solution File: MSC005-1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : MSC005-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n006.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  : 300s
% DateTime : Wed Jul 27 13:06:17 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ value(A,truth)
    | ~ value(B,truth)
    | value(xor(A,B),falsity) ),
    file('MSC005-1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ value(A,truth)
    | ~ value(B,falsity)
    | value(xor(A,B),truth) ),
    file('MSC005-1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ value(A,falsity)
    | ~ value(B,falsity)
    | value(xor(A,B),falsity) ),
    file('MSC005-1.p',unknown),
    [] ).

cnf(5,axiom,
    ~ value(xor(xor(xor(xor(truth,falsity),falsity),truth),falsity),A),
    file('MSC005-1.p',unknown),
    [] ).

cnf(6,axiom,
    value(truth,truth),
    file('MSC005-1.p',unknown),
    [] ).

cnf(7,axiom,
    value(falsity,falsity),
    file('MSC005-1.p',unknown),
    [] ).

cnf(11,plain,
    value(xor(truth,falsity),truth),
    inference(hyper,[status(thm)],[7,2,6]),
    [iquote('hyper,7,2,6')] ).

cnf(38,plain,
    value(xor(xor(truth,falsity),falsity),truth),
    inference(hyper,[status(thm)],[11,2,7]),
    [iquote('hyper,11,2,7')] ).

cnf(536,plain,
    value(xor(xor(xor(truth,falsity),falsity),truth),falsity),
    inference(hyper,[status(thm)],[38,1,6]),
    [iquote('hyper,38,1,6')] ).

cnf(11050,plain,
    value(xor(xor(xor(xor(truth,falsity),falsity),truth),falsity),falsity),
    inference(hyper,[status(thm)],[536,4,7]),
    [iquote('hyper,536,4,7')] ).

cnf(11051,plain,
    $false,
    inference(binary,[status(thm)],[11050,5]),
    [iquote('binary,11050.1,5.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11  % Problem  : MSC005-1 : TPTP v8.1.0. Released v1.0.0.
% 0.02/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n006.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  : 300
% 0.12/0.33  % DateTime : Wed Jul 27 08:58:46 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 2.27/2.43  ----- Otter 3.3f, August 2004 -----
% 2.27/2.43  The process was started by sandbox2 on n006.cluster.edu,
% 2.27/2.43  Wed Jul 27 08:58:47 2022
% 2.27/2.43  The command was "./otter".  The process ID is 4640.
% 2.27/2.43  
% 2.27/2.43  set(prolog_style_variables).
% 2.27/2.43  set(auto).
% 2.27/2.43     dependent: set(auto1).
% 2.27/2.43     dependent: set(process_input).
% 2.27/2.43     dependent: clear(print_kept).
% 2.27/2.43     dependent: clear(print_new_demod).
% 2.27/2.43     dependent: clear(print_back_demod).
% 2.27/2.43     dependent: clear(print_back_sub).
% 2.27/2.43     dependent: set(control_memory).
% 2.27/2.43     dependent: assign(max_mem, 12000).
% 2.27/2.43     dependent: assign(pick_given_ratio, 4).
% 2.27/2.43     dependent: assign(stats_level, 1).
% 2.27/2.43     dependent: assign(max_seconds, 10800).
% 2.27/2.43  clear(print_given).
% 2.27/2.43  
% 2.27/2.43  list(usable).
% 2.27/2.43  0 [] value(truth,truth).
% 2.27/2.43  0 [] value(falsity,falsity).
% 2.27/2.43  0 [] -value(X,truth)| -value(Y,truth)|value(xor(X,Y),falsity).
% 2.27/2.43  0 [] -value(X,truth)| -value(Y,falsity)|value(xor(X,Y),truth).
% 2.27/2.43  0 [] -value(X,falsity)| -value(Y,truth)|value(xor(X,Y),truth).
% 2.27/2.43  0 [] -value(X,falsity)| -value(Y,falsity)|value(xor(X,Y),falsity).
% 2.27/2.43  0 [] -value(xor(xor(xor(xor(truth,falsity),falsity),truth),falsity),Value).
% 2.27/2.43  end_of_list.
% 2.27/2.43  
% 2.27/2.43  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.27/2.43  
% 2.27/2.43  This is a Horn set without equality.  The strategy will
% 2.27/2.43  be hyperresolution, with satellites in sos and nuclei
% 2.27/2.43  in usable.
% 2.27/2.43  
% 2.27/2.43     dependent: set(hyper_res).
% 2.27/2.43     dependent: clear(order_hyper).
% 2.27/2.43  
% 2.27/2.43  ------------> process usable:
% 2.27/2.43  ** KEPT (pick-wt=11): 1 [] -value(A,truth)| -value(B,truth)|value(xor(A,B),falsity).
% 2.27/2.43  ** KEPT (pick-wt=11): 2 [] -value(A,truth)| -value(B,falsity)|value(xor(A,B),truth).
% 2.27/2.43  ** KEPT (pick-wt=11): 3 [] -value(A,falsity)| -value(B,truth)|value(xor(A,B),truth).
% 2.27/2.43  ** KEPT (pick-wt=11): 4 [] -value(A,falsity)| -value(B,falsity)|value(xor(A,B),falsity).
% 2.27/2.43  ** KEPT (pick-wt=11): 5 [] -value(xor(xor(xor(xor(truth,falsity),falsity),truth),falsity),A).
% 2.27/2.43  
% 2.27/2.43  ------------> process sos:
% 2.27/2.43  ** KEPT (pick-wt=3): 6 [] value(truth,truth).
% 2.27/2.43  ** KEPT (pick-wt=3): 7 [] value(falsity,falsity).
% 2.27/2.43  
% 2.27/2.43  ======= end of input processing =======
% 2.27/2.43  
% 2.27/2.43  =========== start of search ===========
% 2.27/2.43  
% 2.27/2.43  
% 2.27/2.43  Resetting weight limit to 13.
% 2.27/2.43  
% 2.27/2.43  
% 2.27/2.43  Resetting weight limit to 13.
% 2.27/2.43  
% 2.27/2.43  sos_size=10921
% 2.27/2.43  
% 2.27/2.43  -------- PROOF -------- 
% 2.27/2.43  
% 2.27/2.43  ----> UNIT CONFLICT at   0.37 sec ----> 11051 [binary,11050.1,5.1] $F.
% 2.27/2.43  
% 2.27/2.43  Length of proof is 4.  Level of proof is 4.
% 2.27/2.43  
% 2.27/2.43  ---------------- PROOF ----------------
% 2.27/2.43  % SZS status Unsatisfiable
% 2.27/2.43  % SZS output start Refutation
% See solution above
% 2.27/2.43  ------------ end of proof -------------
% 2.27/2.43  
% 2.27/2.43  
% 2.27/2.43  Search stopped by max_proofs option.
% 2.27/2.43  
% 2.27/2.43  
% 2.27/2.43  Search stopped by max_proofs option.
% 2.27/2.43  
% 2.27/2.43  ============ end of search ============
% 2.27/2.43  
% 2.27/2.43  -------------- statistics -------------
% 2.27/2.43  clauses given                108
% 2.27/2.43  clauses generated          11670
% 2.27/2.43  clauses kept               11050
% 2.27/2.43  clauses forward subsumed     105
% 2.27/2.43  clauses back subsumed          0
% 2.27/2.43  Kbytes malloced             4882
% 2.27/2.43  
% 2.27/2.43  ----------- times (seconds) -----------
% 2.27/2.43  user CPU time          0.37          (0 hr, 0 min, 0 sec)
% 2.27/2.43  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 2.27/2.43  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 2.27/2.43  
% 2.27/2.43  That finishes the proof of the theorem.
% 2.27/2.43  
% 2.27/2.43  Process 4640 finished Wed Jul 27 08:58:49 2022
% 2.27/2.43  Otter interrupted
% 2.27/2.43  PROOF FOUND
%------------------------------------------------------------------------------