TSTP Solution File: SYN351+1 by Otter---3.3

View Problem - Process Solution

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

% Computer : n022.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:24:20 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    ( ~ big_f(dollar_c2,dollar_f1(A,B),A,dollar_f1(A,B))
    | ~ big_f(dollar_c2,A,dollar_c2,B)
    | ~ big_f(dollar_c2,B,A,B) ),
    file('SYN351+1.p',unknown),
    [] ).

cnf(3,plain,
    ( ~ big_f(dollar_c2,dollar_f1(dollar_c2,dollar_c2),dollar_c2,dollar_f1(dollar_c2,dollar_c2))
    | ~ big_f(dollar_c2,dollar_c2,dollar_c2,dollar_c2) ),
    inference(factor,[status(thm)],[2]),
    [iquote('factor,2.2.3')] ).

cnf(5,axiom,
    big_f(dollar_c2,A,dollar_c2,B),
    file('SYN351+1.p',unknown),
    [] ).

cnf(7,plain,
    $false,
    inference(hyper,[status(thm)],[5,3,5]),
    [iquote('hyper,5,3,5')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYN351+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.13  % Command  : otter-tptp-script %s
% 0.13/0.34  % Computer : n022.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  : 300
% 0.13/0.34  % DateTime : Wed Jul 27 11:25:20 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.58/1.80  ----- Otter 3.3f, August 2004 -----
% 1.58/1.80  The process was started by sandbox2 on n022.cluster.edu,
% 1.58/1.80  Wed Jul 27 11:25:20 2022
% 1.58/1.80  The command was "./otter".  The process ID is 29395.
% 1.58/1.80  
% 1.58/1.80  set(prolog_style_variables).
% 1.58/1.80  set(auto).
% 1.58/1.80     dependent: set(auto1).
% 1.58/1.80     dependent: set(process_input).
% 1.58/1.80     dependent: clear(print_kept).
% 1.58/1.80     dependent: clear(print_new_demod).
% 1.58/1.80     dependent: clear(print_back_demod).
% 1.58/1.80     dependent: clear(print_back_sub).
% 1.58/1.80     dependent: set(control_memory).
% 1.58/1.80     dependent: assign(max_mem, 12000).
% 1.58/1.80     dependent: assign(pick_given_ratio, 4).
% 1.58/1.80     dependent: assign(stats_level, 1).
% 1.58/1.80     dependent: assign(max_seconds, 10800).
% 1.58/1.80  clear(print_given).
% 1.58/1.80  
% 1.58/1.80  formula_list(usable).
% 1.58/1.80  -(all X1 X2 exists Y1 Y2 all Z (big_f(X1,Y2,X1,Z)-> ((big_f(X1,Y1,X1,Y2)<->big_f(Y1,X2,Y1,Y2))-> (big_f(X1,Y1,X1,Y2)-> (big_f(X1,Y2,Y1,Y2)->big_f(X1,Z,Y1,Z))& (big_f(X1,Z,Y1,Z)-> (big_f(X1,Y1,X1,Y2)<->big_f(X1,Y2,Y1,Y2))))))).
% 1.58/1.80  end_of_list.
% 1.58/1.80  
% 1.58/1.80  -------> usable clausifies to:
% 1.58/1.80  
% 1.58/1.80  list(usable).
% 1.58/1.80  0 [] big_f($c2,Y2,$c2,$f1(Y1,Y2)).
% 1.58/1.80  0 [] -big_f($c2,Y1,$c2,Y2)|big_f(Y1,$c1,Y1,Y2).
% 1.58/1.80  0 [] big_f($c2,Y1,$c2,Y2).
% 1.58/1.80  0 [] big_f($c2,Y2,Y1,Y2)|big_f($c2,$f1(Y1,Y2),Y1,$f1(Y1,Y2)).
% 1.58/1.80  0 [] -big_f($c2,$f1(Y1,Y2),Y1,$f1(Y1,Y2))| -big_f($c2,Y1,$c2,Y2)| -big_f($c2,Y2,Y1,Y2).
% 1.58/1.80  end_of_list.
% 1.58/1.80  
% 1.58/1.80  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.58/1.80  
% 1.58/1.80  This is a non-Horn set without equality.  The strategy will
% 1.58/1.80  be ordered hyper_res, unit deletion, and factoring, with
% 1.58/1.80  satellites in sos and with nuclei in usable.
% 1.58/1.80  
% 1.58/1.80     dependent: set(hyper_res).
% 1.58/1.80     dependent: set(factor).
% 1.58/1.80     dependent: set(unit_deletion).
% 1.58/1.80  
% 1.58/1.80  ------------> process usable:
% 1.58/1.80  ** KEPT (pick-wt=10): 1 [] -big_f($c2,A,$c2,B)|big_f(A,$c1,A,B).
% 1.58/1.80  ** KEPT (pick-wt=19): 2 [] -big_f($c2,$f1(A,B),A,$f1(A,B))| -big_f($c2,A,$c2,B)| -big_f($c2,B,A,B).
% 1.58/1.80  
% 1.58/1.80  ------------> process sos:
% 1.58/1.80  ** KEPT (pick-wt=7): 4 [] big_f($c2,A,$c2,$f1(B,A)).
% 1.58/1.80  ** KEPT (pick-wt=5): 5 [] big_f($c2,A,$c2,B).
% 1.58/1.80  ** KEPT (pick-wt=14): 6 [] big_f($c2,A,B,A)|big_f($c2,$f1(B,A),B,$f1(B,A)).
% 1.58/1.80  5 back subsumes 4.
% 1.58/1.80  
% 1.58/1.80  ======= end of input processing =======
% 1.58/1.80  
% 1.58/1.80  =========== start of search ===========
% 1.58/1.80  
% 1.58/1.80  -------- PROOF -------- 
% 1.58/1.80  
% 1.58/1.80  -----> EMPTY CLAUSE at   0.00 sec ----> 7 [hyper,5,3,5] $F.
% 1.58/1.80  
% 1.58/1.80  Length of proof is 1.  Level of proof is 1.
% 1.58/1.80  
% 1.58/1.80  ---------------- PROOF ----------------
% 1.58/1.80  % SZS status Theorem
% 1.58/1.80  % SZS output start Refutation
% See solution above
% 1.58/1.80  ------------ end of proof -------------
% 1.58/1.80  
% 1.58/1.80  
% 1.58/1.80  Search stopped by max_proofs option.
% 1.58/1.80  
% 1.58/1.80  
% 1.58/1.80  Search stopped by max_proofs option.
% 1.58/1.80  
% 1.58/1.80  ============ end of search ============
% 1.58/1.80  
% 1.58/1.80  -------------- statistics -------------
% 1.58/1.80  clauses given                  1
% 1.58/1.80  clauses generated              2
% 1.58/1.80  clauses kept                   6
% 1.58/1.80  clauses forward subsumed       0
% 1.58/1.80  clauses back subsumed          1
% 1.58/1.80  Kbytes malloced              976
% 1.58/1.80  
% 1.58/1.80  ----------- times (seconds) -----------
% 1.58/1.80  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.58/1.80  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.58/1.80  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.58/1.80  
% 1.58/1.80  That finishes the proof of the theorem.
% 1.58/1.80  
% 1.58/1.80  Process 29395 finished Wed Jul 27 11:25:21 2022
% 1.58/1.80  Otter interrupted
% 1.58/1.80  PROOF FOUND
%------------------------------------------------------------------------------