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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : CSR035+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n018.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 12:48:50 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ mtvisible(c_englishmt)
    | prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege) ),
    file('CSR035+1.p',unknown),
    [] ).

cnf(28,axiom,
    ~ prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),A),
    file('CSR035+1.p',unknown),
    [] ).

cnf(35,axiom,
    mtvisible(c_englishmt),
    file('CSR035+1.p',unknown),
    [] ).

cnf(36,plain,
    prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege),
    inference(hyper,[status(thm)],[35,1]),
    [iquote('hyper,35,1')] ).

cnf(37,plain,
    $false,
    inference(binary,[status(thm)],[36,28]),
    [iquote('binary,36.1,28.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : CSR035+1 : TPTP v8.1.0. Released v3.4.0.
% 0.10/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n018.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 04:24:01 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.62/1.84  ----- Otter 3.3f, August 2004 -----
% 1.62/1.84  The process was started by sandbox on n018.cluster.edu,
% 1.62/1.84  Wed Jul 27 04:24:01 2022
% 1.62/1.84  The command was "./otter".  The process ID is 30846.
% 1.62/1.84  
% 1.62/1.84  set(prolog_style_variables).
% 1.62/1.84  set(auto).
% 1.62/1.84     dependent: set(auto1).
% 1.62/1.84     dependent: set(process_input).
% 1.62/1.84     dependent: clear(print_kept).
% 1.62/1.84     dependent: clear(print_new_demod).
% 1.62/1.84     dependent: clear(print_back_demod).
% 1.62/1.84     dependent: clear(print_back_sub).
% 1.62/1.84     dependent: set(control_memory).
% 1.62/1.84     dependent: assign(max_mem, 12000).
% 1.62/1.84     dependent: assign(pick_given_ratio, 4).
% 1.62/1.84     dependent: assign(stats_level, 1).
% 1.62/1.84     dependent: assign(max_seconds, 10800).
% 1.62/1.84  clear(print_given).
% 1.62/1.84  
% 1.62/1.84  formula_list(usable).
% 1.62/1.84  mtvisible(c_englishmt)->prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege).
% 1.62/1.84  all OBJ COL1 COL2 (-(isa(OBJ,COL1)&isa(OBJ,COL2)&disjointwith(COL1,COL2))).
% 1.62/1.84  all SPECPRED PRED GENLPRED (genlinverse(SPECPRED,PRED)&genlinverse(PRED,GENLPRED)->genlpreds(SPECPRED,GENLPRED)).
% 1.62/1.84  all ARG1 INS (genlpreds(ARG1,INS)->predicate(INS)).
% 1.62/1.84  all ARG1 INS (genlpreds(ARG1,INS)->predicate(INS)).
% 1.62/1.84  all INS ARG2 (genlpreds(INS,ARG2)->predicate(INS)).
% 1.62/1.84  all INS ARG2 (genlpreds(INS,ARG2)->predicate(INS)).
% 1.62/1.84  all X Y Z (genlpreds(X,Y)&genlpreds(Y,Z)->genlpreds(X,Z)).
% 1.62/1.84  all X (predicate(X)->genlpreds(X,X)).
% 1.62/1.84  all X (predicate(X)->genlpreds(X,X)).
% 1.62/1.84  all ARG1 INS (genlinverse(ARG1,INS)->binarypredicate(INS)).
% 1.62/1.84  all INS ARG2 (genlinverse(INS,ARG2)->binarypredicate(INS)).
% 1.62/1.84  all OLD ARG2 NEW (genlinverse(OLD,ARG2)&genlpreds(NEW,OLD)->genlinverse(NEW,ARG2)).
% 1.62/1.84  all ARG1 OLD NEW (genlinverse(ARG1,OLD)&genlpreds(OLD,NEW)->genlinverse(ARG1,NEW)).
% 1.62/1.84  all ARG1 INS (disjointwith(ARG1,INS)->collection(INS)).
% 1.62/1.84  all INS ARG2 (disjointwith(INS,ARG2)->collection(INS)).
% 1.62/1.84  all X Y (disjointwith(X,Y)->disjointwith(Y,X)).
% 1.62/1.84  all ARG1 OLD NEW (disjointwith(ARG1,OLD)&genls(NEW,OLD)->disjointwith(ARG1,NEW)).
% 1.62/1.84  all OLD ARG2 NEW (disjointwith(OLD,ARG2)&genls(NEW,OLD)->disjointwith(NEW,ARG2)).
% 1.62/1.84  all ARG1 INS (isa(ARG1,INS)->collection(INS)).
% 1.62/1.84  all ARG1 INS (isa(ARG1,INS)->collection(INS)).
% 1.62/1.84  all INS ARG2 (isa(INS,ARG2)->thing(INS)).
% 1.62/1.84  all INS ARG2 (isa(INS,ARG2)->thing(INS)).
% 1.62/1.84  all ARG1 OLD NEW (isa(ARG1,OLD)&genls(OLD,NEW)->isa(ARG1,NEW)).
% 1.62/1.84  mtvisible(c_basekb).
% 1.62/1.84  all ARG1 INS (affiliatedwith(ARG1,INS)->agent_generic(INS)).
% 1.62/1.84  all INS ARG2 (affiliatedwith(INS,ARG2)->agent_generic(INS)).
% 1.62/1.84  all X Y (affiliatedwith(X,Y)->affiliatedwith(Y,X)).
% 1.62/1.84  all X (-affiliatedwith(X,X)).
% 1.62/1.84  all X (isa(X,c_footballteam)->footballteam(X)).
% 1.62/1.84  all X (footballteam(X)->isa(X,c_footballteam)).
% 1.62/1.84  all ARG1 ARG2 ARG3 natfunction(f_instancewithrelationtofn(ARG1,ARG2,ARG3),c_instancewithrelationtofn).
% 1.62/1.84  all ARG1 ARG2 ARG3 natargument(f_instancewithrelationtofn(ARG1,ARG2,ARG3),n_1,ARG1).
% 1.62/1.84  all ARG1 ARG2 ARG3 natargument(f_instancewithrelationtofn(ARG1,ARG2,ARG3),n_2,ARG2).
% 1.62/1.84  all ARG1 ARG2 ARG3 natargument(f_instancewithrelationtofn(ARG1,ARG2,ARG3),n_3,ARG3).
% 1.62/1.84  all ARG1 ARG2 ARG3 thing(f_instancewithrelationtofn(ARG1,ARG2,ARG3)).
% 1.62/1.84  all ARG1 INS (prettystring(ARG1,INS)->controlcharacterfreestring(INS)).
% 1.62/1.84  all INS ARG2 (prettystring(INS,ARG2)->thing(INS)).
% 1.62/1.84  -(exists X (mtvisible(c_englishmt)->prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X))).
% 1.62/1.84  end_of_list.
% 1.62/1.84  
% 1.62/1.84  -------> usable clausifies to:
% 1.62/1.84  
% 1.62/1.84  list(usable).
% 1.62/1.84  0 [] -mtvisible(c_englishmt)|prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege).
% 1.62/1.84  0 [] -isa(OBJ,COL1)| -isa(OBJ,COL2)| -disjointwith(COL1,COL2).
% 1.62/1.84  0 [] -genlinverse(SPECPRED,PRED)| -genlinverse(PRED,GENLPRED)|genlpreds(SPECPRED,GENLPRED).
% 1.62/1.84  0 [] -genlpreds(ARG1,INS)|predicate(INS).
% 1.62/1.84  0 [] -genlpreds(ARG1,INS)|predicate(INS).
% 1.62/1.84  0 [] -genlpreds(INS,ARG2)|predicate(INS).
% 1.62/1.84  0 [] -genlpreds(INS,ARG2)|predicate(INS).
% 1.62/1.84  0 [] -genlpreds(X,Y)| -genlpreds(Y,Z)|genlpreds(X,Z).
% 1.62/1.84  0 [] -predicate(X)|genlpreds(X,X).
% 1.62/1.84  0 [] -predicate(X)|genlpreds(X,X).
% 1.62/1.84  0 [] -genlinverse(ARG1,INS)|binarypredicate(INS).
% 1.62/1.84  0 [] -genlinverse(INS,ARG2)|binarypredicate(INS).
% 1.62/1.84  0 [] -genlinverse(OLD,ARG2)| -genlpreds(NEW,OLD)|genlinverse(NEW,ARG2).
% 1.62/1.84  0 [] -genlinverse(ARG1,OLD)| -genlpreds(OLD,NEW)|genlinverse(ARG1,NEW).
% 1.62/1.84  0 [] -disjointwith(ARG1,INS)|collection(INS).
% 1.62/1.84  0 [] -disjointwith(INS,ARG2)|collection(INS).
% 1.62/1.84  0 [] -disjointwith(X,Y)|disjointwith(Y,X).
% 1.62/1.84  0 [] -disjointwith(ARG1,OLD)| -genls(NEW,OLD)|disjointwith(ARG1,NEW).
% 1.62/1.84  0 [] -disjointwith(OLD,ARG2)| -genls(NEW,OLD)|disjointwith(NEW,ARG2).
% 1.62/1.84  0 [] -isa(ARG1,INS)|collection(INS).
% 1.62/1.84  0 [] -isa(ARG1,INS)|collection(INS).
% 1.62/1.84  0 [] -isa(INS,ARG2)|thing(INS).
% 1.62/1.84  0 [] -isa(INS,ARG2)|thing(INS).
% 1.62/1.84  0 [] -isa(ARG1,OLD)| -genls(OLD,NEW)|isa(ARG1,NEW).
% 1.62/1.84  0 [] mtvisible(c_basekb).
% 1.62/1.84  0 [] -affiliatedwith(ARG1,INS)|agent_generic(INS).
% 1.62/1.84  0 [] -affiliatedwith(INS,ARG2)|agent_generic(INS).
% 1.62/1.84  0 [] -affiliatedwith(X,Y)|affiliatedwith(Y,X).
% 1.62/1.84  0 [] -affiliatedwith(X,X).
% 1.62/1.84  0 [] -isa(X,c_footballteam)|footballteam(X).
% 1.62/1.84  0 [] -footballteam(X)|isa(X,c_footballteam).
% 1.62/1.84  0 [] natfunction(f_instancewithrelationtofn(ARG1,ARG2,ARG3),c_instancewithrelationtofn).
% 1.62/1.84  0 [] natargument(f_instancewithrelationtofn(ARG1,ARG2,ARG3),n_1,ARG1).
% 1.62/1.84  0 [] natargument(f_instancewithrelationtofn(ARG1,ARG2,ARG3),n_2,ARG2).
% 1.62/1.84  0 [] natargument(f_instancewithrelationtofn(ARG1,ARG2,ARG3),n_3,ARG3).
% 1.62/1.84  0 [] thing(f_instancewithrelationtofn(ARG1,ARG2,ARG3)).
% 1.62/1.84  0 [] -prettystring(ARG1,INS)|controlcharacterfreestring(INS).
% 1.62/1.84  0 [] -prettystring(INS,ARG2)|thing(INS).
% 1.62/1.84  0 [] mtvisible(c_englishmt).
% 1.62/1.84  0 [] -prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),X).
% 1.62/1.84  end_of_list.
% 1.62/1.84  
% 1.62/1.84  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.62/1.84  
% 1.62/1.84  This is a Horn set without equality.  The strategy will
% 1.62/1.84  be hyperresolution, with satellites in sos and nuclei
% 1.62/1.84  in usable.
% 1.62/1.84  
% 1.62/1.84     dependent: set(hyper_res).
% 1.62/1.84     dependent: clear(order_hyper).
% 1.62/1.84  
% 1.62/1.84  ------------> process usable:
% 1.62/1.84  ** KEPT (pick-wt=8): 1 [] -mtvisible(c_englishmt)|prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),s_thefootballteamwhohasbeenaffiliatedwithbeloitcollege).
% 1.62/1.84  ** KEPT (pick-wt=9): 2 [] -isa(A,B)| -isa(A,C)| -disjointwith(B,C).
% 1.62/1.84  ** KEPT (pick-wt=9): 3 [] -genlinverse(A,B)| -genlinverse(B,C)|genlpreds(A,C).
% 1.62/1.84  ** KEPT (pick-wt=5): 4 [] -genlpreds(A,B)|predicate(B).
% 1.62/1.84    Following clause subsumed by 4 during input processing: 0 [] -genlpreds(A,B)|predicate(B).
% 1.62/1.84  ** KEPT (pick-wt=5): 5 [] -genlpreds(A,B)|predicate(A).
% 1.62/1.84    Following clause subsumed by 5 during input processing: 0 [] -genlpreds(A,B)|predicate(A).
% 1.62/1.84  ** KEPT (pick-wt=9): 6 [] -genlpreds(A,B)| -genlpreds(B,C)|genlpreds(A,C).
% 1.62/1.84  ** KEPT (pick-wt=5): 7 [] -predicate(A)|genlpreds(A,A).
% 1.62/1.84    Following clause subsumed by 7 during input processing: 0 [] -predicate(A)|genlpreds(A,A).
% 1.62/1.84  ** KEPT (pick-wt=5): 8 [] -genlinverse(A,B)|binarypredicate(B).
% 1.62/1.84  ** KEPT (pick-wt=5): 9 [] -genlinverse(A,B)|binarypredicate(A).
% 1.62/1.84  ** KEPT (pick-wt=9): 10 [] -genlinverse(A,B)| -genlpreds(C,A)|genlinverse(C,B).
% 1.62/1.84  ** KEPT (pick-wt=9): 11 [] -genlinverse(A,B)| -genlpreds(B,C)|genlinverse(A,C).
% 1.62/1.84  ** KEPT (pick-wt=5): 12 [] -disjointwith(A,B)|collection(B).
% 1.62/1.84  ** KEPT (pick-wt=5): 13 [] -disjointwith(A,B)|collection(A).
% 1.62/1.84  ** KEPT (pick-wt=6): 14 [] -disjointwith(A,B)|disjointwith(B,A).
% 1.62/1.84  ** KEPT (pick-wt=9): 15 [] -disjointwith(A,B)| -genls(C,B)|disjointwith(A,C).
% 1.62/1.84  ** KEPT (pick-wt=9): 16 [] -disjointwith(A,B)| -genls(C,A)|disjointwith(C,B).
% 1.62/1.84  ** KEPT (pick-wt=5): 17 [] -isa(A,B)|collection(B).
% 1.62/1.84    Following clause subsumed by 17 during input processing: 0 [] -isa(A,B)|collection(B).
% 1.62/1.84  ** KEPT (pick-wt=5): 18 [] -isa(A,B)|thing(A).
% 1.62/1.84    Following clause subsumed by 18 during input processing: 0 [] -isa(A,B)|thing(A).
% 1.62/1.84  ** KEPT (pick-wt=9): 19 [] -isa(A,B)| -genls(B,C)|isa(A,C).
% 1.62/1.84  ** KEPT (pick-wt=5): 20 [] -affiliatedwith(A,B)|agent_generic(B).
% 1.62/1.84  ** KEPT (pick-wt=5): 21 [] -affiliatedwith(A,B)|agent_generic(A).
% 1.62/1.84  ** KEPT (pick-wt=6): 22 [] -affiliatedwith(A,B)|affiliatedwith(B,A).
% 1.62/1.84  ** KEPT (pick-wt=3): 23 [] -affiliatedwith(A,A).
% 1.62/1.84  ** KEPT (pick-wt=5): 24 [] -isa(A,c_footballteam)|footballteam(A).
% 1.62/1.84  ** KEPT (pick-wt=5): 25 [] -footballteam(A)|isa(A,c_footballteam).
% 1.62/1.84  ** KEPT (pick-wt=5): 26 [] -prettystring(A,B)|controlcharacterfreestring(B).
% 1.62/1.84  ** KEPT (pick-wt=5): 27 [] -prettystring(A,B)|thing(A).
% 1.62/1.84  ** KEPT (pick-wt=6): 28 [] -prettystring(f_instancewithrelationtofn(c_footballteam,c_affiliatedwith,c_beloitcollege),A).
% 1.62/1.84  
% 1.62/1.84  ------------> process sos:
% 1.62/1.84  ** KEPT (pick-wt=2): 29 [] mtvisible(c_basekb).
% 1.62/1.84  ** KEPT (pick-wt=6): 30 [] natfunction(f_instancewithrelationtofn(A,B,C),c_instancewithrelationtofn).
% 1.62/1.84  ** KEPT (pick-wt=7): 31 [] natargument(f_instancewithrelationtofn(A,B,C),n_1,A).
% 1.62/1.84  ** KEPT (pick-wt=7): 32 [] natargument(f_instancewithrelationtofn(A,B,C),n_2,B).
% 1.62/1.84  ** KEPT (pick-wt=7): 33 [] natargument(f_instancewithrelationtofn(A,B,C),n_3,C).
% 1.62/1.84  ** KEPT (pick-wt=5): 34 [] thing(f_instancewithrelationtofn(A,B,C)).
% 1.62/1.84  ** KEPT (pick-wt=2): 35 [] mtvisible(c_englishmt).
% 1.62/1.84  
% 1.62/1.84  ======= end of input processing =======
% 1.62/1.84  
% 1.62/1.84  =========== start of search ===========
% 1.62/1.84  
% 1.62/1.84  -------- PROOF -------- 
% 1.62/1.84  
% 1.62/1.84  ----> UNIT CONFLICT at   0.00 sec ----> 37 [binary,36.1,28.1] $F.
% 1.62/1.84  
% 1.62/1.84  Length of proof is 1.  Level of proof is 1.
% 1.62/1.84  
% 1.62/1.84  ---------------- PROOF ----------------
% 1.62/1.84  % SZS status Theorem
% 1.62/1.84  % SZS output start Refutation
% See solution above
% 1.62/1.84  ------------ end of proof -------------
% 1.62/1.84  
% 1.62/1.84  
% 1.62/1.84  Search stopped by max_proofs option.
% 1.62/1.84  
% 1.62/1.84  
% 1.62/1.84  Search stopped by max_proofs option.
% 1.62/1.84  
% 1.62/1.84  ============ end of search ============
% 1.62/1.84  
% 1.62/1.84  -------------- statistics -------------
% 1.62/1.84  clauses given                  2
% 1.62/1.84  clauses generated              1
% 1.62/1.84  clauses kept                  36
% 1.62/1.84  clauses forward subsumed       5
% 1.62/1.84  clauses back subsumed          0
% 1.62/1.84  Kbytes malloced              976
% 1.62/1.84  
% 1.62/1.84  ----------- times (seconds) -----------
% 1.62/1.84  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.62/1.84  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.62/1.84  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.62/1.84  
% 1.62/1.84  That finishes the proof of the theorem.
% 1.62/1.84  
% 1.62/1.84  Process 30846 finished Wed Jul 27 04:24:02 2022
% 1.62/1.84  Otter interrupted
% 1.62/1.84  PROOF FOUND
%------------------------------------------------------------------------------