↑ Up

Otter---3.3.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : KRS129+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n023.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:01:13 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(13,axiom,
    ~ cowlNothing(A),
    file('KRS129+1.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ xsd_string(A)
    | ~ xsd_integer(A) ),
    file('KRS129+1.p',unknown),
    [] ).

cnf(24,axiom,
    ( cEuroMP(A)
    | ~ risEuroMPFrom(A,B)
    | ~ cowlThing(B) ),
    file('KRS129+1.p',unknown),
    [] ).

cnf(27,axiom,
    ( risEuroMPFrom(A,B)
    | ~ rhasEuroMP(B,A) ),
    file('KRS129+1.p',unknown),
    [] ).

cnf(28,axiom,
    ( ~ cowlThing(dollar_c1)
    | cowlNothing(dollar_c1)
    | xsd_string(dollar_c2)
    | ~ xsd_integer(dollar_c2)
    | ~ cEuroMP(iKinnock) ),
    file('KRS129+1.p',unknown),
    [] ).

cnf(29,plain,
    ( ~ cowlThing(dollar_c1)
    | xsd_string(dollar_c2)
    | ~ xsd_integer(dollar_c2)
    | ~ cEuroMP(iKinnock) ),
    inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[28]),13]),
    [iquote('copy,28,unit_del,13')] ).

cnf(30,axiom,
    ( ~ cowlThing(dollar_c1)
    | cowlNothing(dollar_c1)
    | ~ xsd_string(dollar_c2)
    | xsd_integer(dollar_c2)
    | ~ cEuroMP(iKinnock) ),
    file('KRS129+1.p',unknown),
    [] ).

cnf(31,plain,
    ( ~ cowlThing(dollar_c1)
    | ~ xsd_string(dollar_c2)
    | xsd_integer(dollar_c2)
    | ~ cEuroMP(iKinnock) ),
    inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[30]),13]),
    [iquote('copy,30,unit_del,13')] ).

cnf(33,axiom,
    cowlThing(A),
    file('KRS129+1.p',unknown),
    [] ).

cnf(34,axiom,
    ( xsd_string(A)
    | xsd_integer(A) ),
    file('KRS129+1.p',unknown),
    [] ).

cnf(42,axiom,
    rhasEuroMP(iUK,iKinnock),
    file('KRS129+1.p',unknown),
    [] ).

cnf(55,plain,
    risEuroMPFrom(iKinnock,iUK),
    inference(hyper,[status(thm)],[42,27]),
    [iquote('hyper,42,27')] ).

cnf(62,plain,
    cEuroMP(iKinnock),
    inference(hyper,[status(thm)],[55,24,33]),
    [iquote('hyper,55,24,33')] ).

cnf(69,plain,
    xsd_integer(dollar_c2),
    inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[62,31,33,34])]),
    [iquote('hyper,62,31,33,34,factor_simp')] ).

cnf(77,plain,
    xsd_string(dollar_c2),
    inference(hyper,[status(thm)],[69,29,33,62]),
    [iquote('hyper,69,29,33,62')] ).

cnf(100,plain,
    $false,
    inference(hyper,[status(thm)],[77,14,69]),
    [iquote('hyper,77,14,69')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : KRS129+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n023.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 03:52:33 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.98/2.16  ----- Otter 3.3f, August 2004 -----
% 1.98/2.16  The process was started by sandbox on n023.cluster.edu,
% 1.98/2.16  Wed Jul 27 03:52:33 2022
% 1.98/2.16  The command was "./otter".  The process ID is 15423.
% 1.98/2.16  
% 1.98/2.16  set(prolog_style_variables).
% 1.98/2.16  set(auto).
% 1.98/2.16     dependent: set(auto1).
% 1.98/2.16     dependent: set(process_input).
% 1.98/2.16     dependent: clear(print_kept).
% 1.98/2.16     dependent: clear(print_new_demod).
% 1.98/2.16     dependent: clear(print_back_demod).
% 1.98/2.16     dependent: clear(print_back_sub).
% 1.98/2.16     dependent: set(control_memory).
% 1.98/2.16     dependent: assign(max_mem, 12000).
% 1.98/2.16     dependent: assign(pick_given_ratio, 4).
% 1.98/2.16     dependent: assign(stats_level, 1).
% 1.98/2.16     dependent: assign(max_seconds, 10800).
% 1.98/2.16  clear(print_given).
% 1.98/2.16  
% 1.98/2.16  formula_list(usable).
% 1.98/2.16  all A (A=A).
% 1.98/2.16  all A B (A=B&cEUCountry(A)->cEUCountry(B)).
% 1.98/2.16  all A B (A=B&cEuroMP(A)->cEuroMP(B)).
% 1.98/2.16  all A B (A=B&cEuropeanCountry(A)->cEuropeanCountry(B)).
% 1.98/2.16  all A B (A=B&cPerson(A)->cPerson(B)).
% 1.98/2.16  all A B (A=B&cowlNothing(A)->cowlNothing(B)).
% 1.98/2.16  all A B (A=B&cowlThing(A)->cowlThing(B)).
% 1.98/2.16  all A B C (A=B&rhasEuroMP(A,C)->rhasEuroMP(B,C)).
% 1.98/2.16  all A B C (A=B&rhasEuroMP(C,A)->rhasEuroMP(C,B)).
% 1.98/2.16  all A B C (A=B&risEuroMPFrom(A,C)->risEuroMPFrom(B,C)).
% 1.98/2.16  all A B C (A=B&risEuroMPFrom(C,A)->risEuroMPFrom(C,B)).
% 1.98/2.16  all A B (A=B&xsd_integer(A)->xsd_integer(B)).
% 1.98/2.16  all A B (A=B&xsd_string(A)->xsd_string(B)).
% 1.98/2.16  all X (cowlThing(X)& -cowlNothing(X)).
% 1.98/2.16  all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.98/2.16  all X (cEUCountry(X)<->X=iBE|X=iFR|X=iES|X=iUK|X=iNL|X=iPT).
% 1.98/2.16  all X (cEuroMP(X)<-> (exists Y (risEuroMPFrom(X,Y)&cowlThing(Y)))).
% 1.98/2.16  all X Y (rhasEuroMP(X,Y)->cEUCountry(X)).
% 1.98/2.16  all X Y (risEuroMPFrom(X,Y)<->rhasEuroMP(Y,X)).
% 1.98/2.16  cEuropeanCountry(iBE).
% 1.98/2.16  cEuropeanCountry(iES).
% 1.98/2.16  cEuropeanCountry(iFR).
% 1.98/2.16  cPerson(iKinnock).
% 1.98/2.16  cEuropeanCountry(iNL).
% 1.98/2.16  cEuropeanCountry(iPT).
% 1.98/2.16  cEuropeanCountry(iUK).
% 1.98/2.16  rhasEuroMP(iUK,iKinnock).
% 1.98/2.16  -((all X (cowlThing(X)& -cowlNothing(X)))& (all X (xsd_string(X)<-> -xsd_integer(X)))&cEuroMP(iKinnock)).
% 1.98/2.16  end_of_list.
% 1.98/2.16  
% 1.98/2.16  -------> usable clausifies to:
% 1.98/2.16  
% 1.98/2.16  list(usable).
% 1.98/2.16  0 [] A=A.
% 1.98/2.16  0 [] A!=B| -cEUCountry(A)|cEUCountry(B).
% 1.98/2.16  0 [] A!=B| -cEuroMP(A)|cEuroMP(B).
% 1.98/2.16  0 [] A!=B| -cEuropeanCountry(A)|cEuropeanCountry(B).
% 1.98/2.16  0 [] A!=B| -cPerson(A)|cPerson(B).
% 1.98/2.16  0 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.98/2.16  0 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.98/2.16  0 [] A!=B| -rhasEuroMP(A,C)|rhasEuroMP(B,C).
% 1.98/2.16  0 [] A!=B| -rhasEuroMP(C,A)|rhasEuroMP(C,B).
% 1.98/2.16  0 [] A!=B| -risEuroMPFrom(A,C)|risEuroMPFrom(B,C).
% 1.98/2.16  0 [] A!=B| -risEuroMPFrom(C,A)|risEuroMPFrom(C,B).
% 1.98/2.16  0 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.98/2.16  0 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.98/2.16  0 [] cowlThing(X).
% 1.98/2.16  0 [] -cowlNothing(X).
% 1.98/2.16  0 [] -xsd_string(X)| -xsd_integer(X).
% 1.98/2.16  0 [] xsd_string(X)|xsd_integer(X).
% 1.98/2.16  0 [] -cEUCountry(X)|X=iBE|X=iFR|X=iES|X=iUK|X=iNL|X=iPT.
% 1.98/2.16  0 [] cEUCountry(X)|X!=iBE.
% 1.98/2.16  0 [] cEUCountry(X)|X!=iFR.
% 1.98/2.16  0 [] cEUCountry(X)|X!=iES.
% 1.98/2.16  0 [] cEUCountry(X)|X!=iUK.
% 1.98/2.16  0 [] cEUCountry(X)|X!=iNL.
% 1.98/2.16  0 [] cEUCountry(X)|X!=iPT.
% 1.98/2.16  0 [] -cEuroMP(X)|risEuroMPFrom(X,$f1(X)).
% 1.98/2.16  0 [] -cEuroMP(X)|cowlThing($f1(X)).
% 1.98/2.16  0 [] cEuroMP(X)| -risEuroMPFrom(X,Y)| -cowlThing(Y).
% 1.98/2.16  0 [] -rhasEuroMP(X,Y)|cEUCountry(X).
% 1.98/2.16  0 [] -risEuroMPFrom(X,Y)|rhasEuroMP(Y,X).
% 1.98/2.16  0 [] risEuroMPFrom(X,Y)| -rhasEuroMP(Y,X).
% 1.98/2.16  0 [] cEuropeanCountry(iBE).
% 1.98/2.16  0 [] cEuropeanCountry(iES).
% 1.98/2.16  0 [] cEuropeanCountry(iFR).
% 1.98/2.16  0 [] cPerson(iKinnock).
% 1.98/2.16  0 [] cEuropeanCountry(iNL).
% 1.98/2.16  0 [] cEuropeanCountry(iPT).
% 1.98/2.16  0 [] cEuropeanCountry(iUK).
% 1.98/2.16  0 [] rhasEuroMP(iUK,iKinnock).
% 1.98/2.16  0 [] -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cEuroMP(iKinnock).
% 1.98/2.16  0 [] -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cEuroMP(iKinnock).
% 1.98/2.16  end_of_list.
% 1.98/2.16  
% 1.98/2.16  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.98/2.16  
% 1.98/2.16  This ia a non-Horn set with equality.  The strategy will be
% 1.98/2.16  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.98/2.16  deletion, with positive clauses in sos and nonpositive
% 1.98/2.16  clauses in usable.
% 1.98/2.16  
% 1.98/2.16     dependent: set(knuth_bendix).
% 1.98/2.16     dependent: set(anl_eq).
% 1.98/2.16     dependent: set(para_from).
% 1.98/2.16     dependent: set(para_into).
% 1.98/2.16     dependent: clear(para_from_right).
% 1.98/2.16     dependent: clear(para_into_right).
% 1.98/2.16     dependent: set(para_from_vars).
% 1.98/2.16     dependent: set(eq_units_both_ways).
% 1.98/2.16     dependent: set(dynamic_demod_all).
% 1.98/2.16     dependent: set(dynamic_demod).
% 1.98/2.16     dependent: set(order_eq).
% 1.98/2.16     dependent: set(back_demod).
% 1.98/2.16     dependent: set(lrpo).
% 1.98/2.17     dependent: set(hyper_res).
% 1.98/2.17     dependent: set(unit_deletion).
% 1.98/2.17     dependent: set(factor).
% 1.98/2.17  
% 1.98/2.17  ------------> process usable:
% 1.98/2.17  ** KEPT (pick-wt=7): 1 [] A!=B| -cEUCountry(A)|cEUCountry(B).
% 1.98/2.17  ** KEPT (pick-wt=7): 2 [] A!=B| -cEuroMP(A)|cEuroMP(B).
% 1.98/2.17  ** KEPT (pick-wt=7): 3 [] A!=B| -cEuropeanCountry(A)|cEuropeanCountry(B).
% 1.98/2.17  ** KEPT (pick-wt=7): 4 [] A!=B| -cPerson(A)|cPerson(B).
% 1.98/2.17  ** KEPT (pick-wt=7): 5 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.98/2.17  ** KEPT (pick-wt=7): 6 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.98/2.17  ** KEPT (pick-wt=9): 7 [] A!=B| -rhasEuroMP(A,C)|rhasEuroMP(B,C).
% 1.98/2.17  ** KEPT (pick-wt=9): 8 [] A!=B| -rhasEuroMP(C,A)|rhasEuroMP(C,B).
% 1.98/2.17  ** KEPT (pick-wt=9): 9 [] A!=B| -risEuroMPFrom(A,C)|risEuroMPFrom(B,C).
% 1.98/2.17  ** KEPT (pick-wt=9): 10 [] A!=B| -risEuroMPFrom(C,A)|risEuroMPFrom(C,B).
% 1.98/2.17  ** KEPT (pick-wt=7): 11 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.98/2.17  ** KEPT (pick-wt=7): 12 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.98/2.17  ** KEPT (pick-wt=2): 13 [] -cowlNothing(A).
% 1.98/2.17  ** KEPT (pick-wt=4): 14 [] -xsd_string(A)| -xsd_integer(A).
% 1.98/2.17  ** KEPT (pick-wt=20): 15 [] -cEUCountry(A)|A=iBE|A=iFR|A=iES|A=iUK|A=iNL|A=iPT.
% 1.98/2.17  ** KEPT (pick-wt=5): 16 [] cEUCountry(A)|A!=iBE.
% 1.98/2.17  ** KEPT (pick-wt=5): 17 [] cEUCountry(A)|A!=iFR.
% 1.98/2.17  ** KEPT (pick-wt=5): 18 [] cEUCountry(A)|A!=iES.
% 1.98/2.17  ** KEPT (pick-wt=5): 19 [] cEUCountry(A)|A!=iUK.
% 1.98/2.17  ** KEPT (pick-wt=5): 20 [] cEUCountry(A)|A!=iNL.
% 1.98/2.17  ** KEPT (pick-wt=5): 21 [] cEUCountry(A)|A!=iPT.
% 1.98/2.17  ** KEPT (pick-wt=6): 22 [] -cEuroMP(A)|risEuroMPFrom(A,$f1(A)).
% 1.98/2.17  ** KEPT (pick-wt=5): 23 [] -cEuroMP(A)|cowlThing($f1(A)).
% 1.98/2.17  ** KEPT (pick-wt=7): 24 [] cEuroMP(A)| -risEuroMPFrom(A,B)| -cowlThing(B).
% 1.98/2.17  ** KEPT (pick-wt=5): 25 [] -rhasEuroMP(A,B)|cEUCountry(A).
% 1.98/2.17  ** KEPT (pick-wt=6): 26 [] -risEuroMPFrom(A,B)|rhasEuroMP(B,A).
% 1.98/2.17  ** KEPT (pick-wt=6): 27 [] risEuroMPFrom(A,B)| -rhasEuroMP(B,A).
% 1.98/2.17  ** KEPT (pick-wt=8): 29 [copy,28,unit_del,13] -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cEuroMP(iKinnock).
% 1.98/2.17  ** KEPT (pick-wt=8): 31 [copy,30,unit_del,13] -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cEuroMP(iKinnock).
% 1.98/2.17  13 back subsumes 5.
% 1.98/2.17  
% 1.98/2.17  ------------> process sos:
% 1.98/2.17  ** KEPT (pick-wt=3): 32 [] A=A.
% 1.98/2.17  ** KEPT (pick-wt=2): 33 [] cowlThing(A).
% 1.98/2.17  ** KEPT (pick-wt=4): 34 [] xsd_string(A)|xsd_integer(A).
% 1.98/2.17  ** KEPT (pick-wt=2): 35 [] cEuropeanCountry(iBE).
% 1.98/2.17  ** KEPT (pick-wt=2): 36 [] cEuropeanCountry(iES).
% 1.98/2.17  ** KEPT (pick-wt=2): 37 [] cEuropeanCountry(iFR).
% 1.98/2.17  ** KEPT (pick-wt=2): 38 [] cPerson(iKinnock).
% 1.98/2.17  ** KEPT (pick-wt=2): 39 [] cEuropeanCountry(iNL).
% 1.98/2.17  ** KEPT (pick-wt=2): 40 [] cEuropeanCountry(iPT).
% 1.98/2.17  ** KEPT (pick-wt=2): 41 [] cEuropeanCountry(iUK).
% 1.98/2.17  ** KEPT (pick-wt=3): 42 [] rhasEuroMP(iUK,iKinnock).
% 1.98/2.17    Following clause subsumed by 32 during input processing: 0 [copy,32,flip.1] A=A.
% 1.98/2.17  33 back subsumes 23.
% 1.98/2.17  33 back subsumes 6.
% 1.98/2.17  
% 1.98/2.17  ======= end of input processing =======
% 1.98/2.17  
% 1.98/2.17  =========== start of search ===========
% 1.98/2.17  
% 1.98/2.17  -------- PROOF -------- 
% 1.98/2.17  
% 1.98/2.17  -----> EMPTY CLAUSE at   0.01 sec ----> 100 [hyper,77,14,69] $F.
% 1.98/2.17  
% 1.98/2.17  Length of proof is 6.  Level of proof is 4.
% 1.98/2.17  
% 1.98/2.17  ---------------- PROOF ----------------
% 1.98/2.17  % SZS status Theorem
% 1.98/2.17  % SZS output start Refutation
% See solution above
% 1.98/2.17  ------------ end of proof -------------
% 1.98/2.17  
% 1.98/2.17  
% 1.98/2.17  Search stopped by max_proofs option.
% 1.98/2.17  
% 1.98/2.17  
% 1.98/2.17  Search stopped by max_proofs option.
% 1.98/2.17  
% 1.98/2.17  ============ end of search ============
% 1.98/2.17  
% 1.98/2.17  -------------- statistics -------------
% 1.98/2.17  clauses given                 22
% 1.98/2.17  clauses generated            243
% 1.98/2.17  clauses kept                  97
% 1.98/2.17  clauses forward subsumed     184
% 1.98/2.17  clauses back subsumed          5
% 1.98/2.17  Kbytes malloced              976
% 1.98/2.17  
% 1.98/2.17  ----------- times (seconds) -----------
% 1.98/2.17  user CPU time          0.01          (0 hr, 0 min, 0 sec)
% 1.98/2.17  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.98/2.17  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.98/2.17  
% 1.98/2.17  That finishes the proof of the theorem.
% 1.98/2.17  
% 1.98/2.17  Process 15423 finished Wed Jul 27 03:52:35 2022
% 1.98/2.17  Otter interrupted
% 1.98/2.17  PROOF FOUND
%------------------------------------------------------------------------------