%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS089+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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:07 EDT 2022
% Result : Unsatisfiable 2.08s 2.27s
% Output : Refutation 2.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 25 ( 11 unt; 7 nHn; 12 RR)
% Number of literals : 50 ( 31 equ; 14 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 32 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( A != B
| ~ cUnsatisfiable(A)
| cUnsatisfiable(B) ),
file('KRS089+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ cUnsatisfiable(A)
| dollar_f3(A) != dollar_f2(A) ),
file('KRS089+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ cUnsatisfiable(A)
| dollar_f3(A) != dollar_f1(A) ),
file('KRS089+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ cUnsatisfiable(A)
| dollar_f2(A) != dollar_f1(A) ),
file('KRS089+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ cowlThing(A)
| rp(A,dollar_f4(A)) ),
file('KRS089+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ cowlThing(A)
| dollar_f4(A) = ispy ),
file('KRS089+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ rp(A,B)
| rinvP(B,A) ),
file('KRS089+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ rinvP(ispy,A)
| ~ rinvP(ispy,B)
| ~ rinvP(ispy,C)
| A = B
| A = C
| B = C ),
file('KRS089+1.p',unknown),
[] ).
cnf(27,axiom,
cowlThing(A),
file('KRS089+1.p',unknown),
[] ).
cnf(29,axiom,
cUnsatisfiable(i2003_11_14_17_19_53168),
file('KRS089+1.p',unknown),
[] ).
cnf(31,plain,
dollar_f4(A) = ispy,
inference(hyper,[status(thm)],[27,21]),
[iquote('hyper,27,21')] ).
cnf(32,plain,
rp(A,ispy),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[27,20]),31]),
[iquote('hyper,27,20,demod,31')] ).
cnf(39,plain,
rinvP(ispy,A),
inference(hyper,[status(thm)],[32,22]),
[iquote('hyper,32,22')] ).
cnf(43,plain,
( A = B
| A = C
| B = C ),
inference(hyper,[status(thm)],[39,24,39,39]),
[iquote('hyper,39,24,39,39')] ).
cnf(492,plain,
( dollar_f2(i2003_11_14_17_19_53168) = A
| dollar_f1(i2003_11_14_17_19_53168) = A ),
inference(hyper,[status(thm)],[43,19,29]),
[iquote('hyper,43,19,29')] ).
cnf(521,plain,
( dollar_f3(i2003_11_14_17_19_53168) = A
| dollar_f1(i2003_11_14_17_19_53168) = A ),
inference(hyper,[status(thm)],[43,18,29]),
[iquote('hyper,43,18,29')] ).
cnf(990,plain,
( A = B
| dollar_f1(i2003_11_14_17_19_53168) = B
| dollar_f2(i2003_11_14_17_19_53168) = C
| A = C ),
inference(para_into,[status(thm),theory(equality)],[492,43]),
[iquote('para_into,492.1.1,43.1.1')] ).
cnf(997,plain,
( dollar_f2(i2003_11_14_17_19_53168) = A
| dollar_f1(B) = A
| C = i2003_11_14_17_19_53168
| C = B ),
inference(para_into,[status(thm),theory(equality)],[492,43]),
[iquote('para_into,492.2.1.1,43.3.1')] ).
cnf(1032,plain,
( dollar_f2(i2003_11_14_17_19_53168) = i2003_11_14_17_19_53168
| dollar_f1(A) = i2003_11_14_17_19_53168
| dollar_f1(A) = A ),
inference(factor,[status(thm)],[997]),
[iquote('factor,997.2.3')] ).
cnf(1426,plain,
dollar_f2(i2003_11_14_17_19_53168) = dollar_f1(i2003_11_14_17_19_53168),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[521,17,29])]),
[iquote('hyper,521,17,29,flip.1')] ).
cnf(1542,plain,
dollar_f1(i2003_11_14_17_19_53168) = i2003_11_14_17_19_53168,
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1032]),1426])])]),
[iquote('back_demod,1032,demod,1426,factor_simp,factor_simp')] ).
cnf(1557,plain,
i2003_11_14_17_19_53168 = A,
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[990]),1542,1426,1542])])])]),
[iquote('back_demod,990,demod,1542,1426,1542,factor_simp,factor_simp,factor_simp')] ).
cnf(1578,plain,
cUnsatisfiable(A),
inference(hyper,[status(thm)],[1557,1,29]),
[iquote('hyper,1557,1,29')] ).
cnf(1579,plain,
A = B,
inference(para_into,[status(thm),theory(equality)],[1557,1557]),
[iquote('para_into,1557.1.1,1557.1.1')] ).
cnf(1580,plain,
$false,
inference(hyper,[status(thm)],[1579,19,1578]),
[iquote('hyper,1579,19,1578')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : KRS089+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n007.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 03:16:46 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.78/2.00 ----- Otter 3.3f, August 2004 -----
% 1.78/2.00 The process was started by sandbox on n007.cluster.edu,
% 1.78/2.00 Wed Jul 27 03:16:46 2022
% 1.78/2.00 The command was "./otter". The process ID is 16829.
% 1.78/2.00
% 1.78/2.00 set(prolog_style_variables).
% 1.78/2.00 set(auto).
% 1.78/2.00 dependent: set(auto1).
% 1.78/2.00 dependent: set(process_input).
% 1.78/2.00 dependent: clear(print_kept).
% 1.78/2.00 dependent: clear(print_new_demod).
% 1.78/2.00 dependent: clear(print_back_demod).
% 1.78/2.00 dependent: clear(print_back_sub).
% 1.78/2.00 dependent: set(control_memory).
% 1.78/2.00 dependent: assign(max_mem, 12000).
% 1.78/2.00 dependent: assign(pick_given_ratio, 4).
% 1.78/2.00 dependent: assign(stats_level, 1).
% 1.78/2.00 dependent: assign(max_seconds, 10800).
% 1.78/2.00 clear(print_given).
% 1.78/2.00
% 1.78/2.00 formula_list(usable).
% 1.78/2.00 all A (A=A).
% 1.78/2.00 all A B (A=B&cUnsatisfiable(A)->cUnsatisfiable(B)).
% 1.78/2.00 all A B (A=B&cowlNothing(A)->cowlNothing(B)).
% 1.78/2.00 all A B (A=B&cowlThing(A)->cowlThing(B)).
% 1.78/2.00 all A B C (A=B&rinvP(A,C)->rinvP(B,C)).
% 1.78/2.00 all A B C (A=B&rinvP(C,A)->rinvP(C,B)).
% 1.78/2.00 all A B C (A=B&rp(A,C)->rp(B,C)).
% 1.78/2.00 all A B C (A=B&rp(C,A)->rp(C,B)).
% 1.78/2.00 all A B C (A=B&rr(A,C)->rr(B,C)).
% 1.78/2.00 all A B C (A=B&rr(C,A)->rr(C,B)).
% 1.78/2.00 all A B (A=B&xsd_integer(A)->xsd_integer(B)).
% 1.78/2.00 all A B (A=B&xsd_string(A)->xsd_string(B)).
% 1.78/2.00 all X (cowlThing(X)& -cowlNothing(X)).
% 1.78/2.00 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.78/2.00 all X (cUnsatisfiable(X)-> (exists Y0 Y1 Y2 (rr(X,Y0)&rr(X,Y1)&rr(X,Y2)&Y0!=Y1&Y0!=Y2&Y1!=Y2))).
% 1.78/2.00 all X (cowlThing(X)-> (exists Y (rp(X,Y)&Y=ispy))).
% 1.78/2.00 all X Y (rp(X,Y)<->rinvP(Y,X)).
% 1.78/2.00 all X0 X1 X2 (rinvP(ispy,X0)&rinvP(ispy,X1)&rinvP(ispy,X2)->X0=X1|X0=X2|X1=X2).
% 1.78/2.00 cowlThing(ispy).
% 1.78/2.00 cUnsatisfiable(i2003_11_14_17_19_53168).
% 1.78/2.00 end_of_list.
% 1.78/2.00
% 1.78/2.00 -------> usable clausifies to:
% 1.78/2.00
% 1.78/2.00 list(usable).
% 1.78/2.00 0 [] A=A.
% 1.78/2.00 0 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 1.78/2.00 0 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.78/2.00 0 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.78/2.00 0 [] A!=B| -rinvP(A,C)|rinvP(B,C).
% 1.78/2.00 0 [] A!=B| -rinvP(C,A)|rinvP(C,B).
% 1.78/2.00 0 [] A!=B| -rp(A,C)|rp(B,C).
% 1.78/2.00 0 [] A!=B| -rp(C,A)|rp(C,B).
% 1.78/2.00 0 [] A!=B| -rr(A,C)|rr(B,C).
% 1.78/2.00 0 [] A!=B| -rr(C,A)|rr(C,B).
% 1.78/2.00 0 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.78/2.00 0 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.78/2.00 0 [] cowlThing(X).
% 1.78/2.00 0 [] -cowlNothing(X).
% 1.78/2.00 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.78/2.00 0 [] xsd_string(X)|xsd_integer(X).
% 1.78/2.00 0 [] -cUnsatisfiable(X)|rr(X,$f3(X)).
% 1.78/2.00 0 [] -cUnsatisfiable(X)|rr(X,$f2(X)).
% 1.78/2.00 0 [] -cUnsatisfiable(X)|rr(X,$f1(X)).
% 1.78/2.00 0 [] -cUnsatisfiable(X)|$f3(X)!=$f2(X).
% 1.78/2.00 0 [] -cUnsatisfiable(X)|$f3(X)!=$f1(X).
% 1.78/2.00 0 [] -cUnsatisfiable(X)|$f2(X)!=$f1(X).
% 1.78/2.00 0 [] -cowlThing(X)|rp(X,$f4(X)).
% 1.78/2.00 0 [] -cowlThing(X)|$f4(X)=ispy.
% 1.78/2.00 0 [] -rp(X,Y)|rinvP(Y,X).
% 1.78/2.00 0 [] rp(X,Y)| -rinvP(Y,X).
% 1.78/2.00 0 [] -rinvP(ispy,X0)| -rinvP(ispy,X1)| -rinvP(ispy,X2)|X0=X1|X0=X2|X1=X2.
% 1.78/2.00 0 [] cowlThing(ispy).
% 1.78/2.00 0 [] cUnsatisfiable(i2003_11_14_17_19_53168).
% 1.78/2.00 end_of_list.
% 1.78/2.00
% 1.78/2.00 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.78/2.00
% 1.78/2.00 This ia a non-Horn set with equality. The strategy will be
% 1.78/2.00 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.78/2.00 deletion, with positive clauses in sos and nonpositive
% 1.78/2.00 clauses in usable.
% 1.78/2.00
% 1.78/2.00 dependent: set(knuth_bendix).
% 1.78/2.00 dependent: set(anl_eq).
% 1.78/2.00 dependent: set(para_from).
% 1.78/2.00 dependent: set(para_into).
% 1.78/2.00 dependent: clear(para_from_right).
% 1.78/2.00 dependent: clear(para_into_right).
% 1.78/2.00 dependent: set(para_from_vars).
% 1.78/2.00 dependent: set(eq_units_both_ways).
% 1.78/2.00 dependent: set(dynamic_demod_all).
% 1.78/2.00 dependent: set(dynamic_demod).
% 1.78/2.00 dependent: set(order_eq).
% 1.78/2.00 dependent: set(back_demod).
% 1.78/2.00 dependent: set(lrpo).
% 1.78/2.00 dependent: set(hyper_res).
% 1.78/2.00 dependent: set(unit_deletion).
% 1.78/2.00 dependent: set(factor).
% 1.78/2.00
% 1.78/2.00 ------------> process usable:
% 1.78/2.00 ** KEPT (pick-wt=7): 1 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 1.78/2.00 ** KEPT (pick-wt=7): 2 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.78/2.00 ** KEPT (pick-wt=7): 3 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.78/2.00 ** KEPT (pick-wt=9): 4 [] A!=B| -rinvP(A,C)|rinvP(B,C).
% 1.78/2.00 ** KEPT (pick-wt=9): 5 [] A!=B| -rinvP(C,A)|rinvP(C,B).
% 1.78/2.00 ** KEPT (pick-wt=9): 6 [] A!=B| -rp(A,C)|rp(B,C).
% 1.78/2.00 ** KEPT (pick-wt=9): 7 [] A!=B| -rp(C,A)|rp(C,B).
% 1.78/2.00 ** KEPT (pick-wt=9): 8 [] A!=B| -rr(A,C)|rr(B,C).
% 1.78/2.00 ** KEPT (pick-wt=9): 9 [] A!=B| -rr(C,A)|rr(C,B).
% 1.78/2.00 ** KEPT (pick-wt=7): 10 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.78/2.00 ** KEPT (pick-wt=7): 11 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.78/2.00 ** KEPT (pick-wt=2): 12 [] -cowlNothing(A).
% 1.78/2.00 ** KEPT (pick-wt=4): 13 [] -xsd_string(A)| -xsd_integer(A).
% 2.08/2.27 ** KEPT (pick-wt=6): 14 [] -cUnsatisfiable(A)|rr(A,$f3(A)).
% 2.08/2.27 ** KEPT (pick-wt=6): 15 [] -cUnsatisfiable(A)|rr(A,$f2(A)).
% 2.08/2.27 ** KEPT (pick-wt=6): 16 [] -cUnsatisfiable(A)|rr(A,$f1(A)).
% 2.08/2.27 ** KEPT (pick-wt=7): 17 [] -cUnsatisfiable(A)|$f3(A)!=$f2(A).
% 2.08/2.27 ** KEPT (pick-wt=7): 18 [] -cUnsatisfiable(A)|$f3(A)!=$f1(A).
% 2.08/2.27 ** KEPT (pick-wt=7): 19 [] -cUnsatisfiable(A)|$f2(A)!=$f1(A).
% 2.08/2.27 ** KEPT (pick-wt=6): 20 [] -cowlThing(A)|rp(A,$f4(A)).
% 2.08/2.27 ** KEPT (pick-wt=6): 21 [] -cowlThing(A)|$f4(A)=ispy.
% 2.08/2.27 ** KEPT (pick-wt=6): 22 [] -rp(A,B)|rinvP(B,A).
% 2.08/2.27 ** KEPT (pick-wt=6): 23 [] rp(A,B)| -rinvP(B,A).
% 2.08/2.27 ** KEPT (pick-wt=18): 24 [] -rinvP(ispy,A)| -rinvP(ispy,B)| -rinvP(ispy,C)|A=B|A=C|B=C.
% 2.08/2.27 12 back subsumes 2.
% 2.08/2.27
% 2.08/2.27 ------------> process sos:
% 2.08/2.27 ** KEPT (pick-wt=3): 26 [] A=A.
% 2.08/2.27 ** KEPT (pick-wt=2): 27 [] cowlThing(A).
% 2.08/2.27 ** KEPT (pick-wt=4): 28 [] xsd_string(A)|xsd_integer(A).
% 2.08/2.27 Following clause subsumed by 27 during input processing: 0 [] cowlThing(ispy).
% 2.08/2.27 ** KEPT (pick-wt=2): 29 [] cUnsatisfiable(i2003_11_14_17_19_53168).
% 2.08/2.27 Following clause subsumed by 26 during input processing: 0 [copy,26,flip.1] A=A.
% 2.08/2.27 26 back subsumes 25.
% 2.08/2.27 27 back subsumes 3.
% 2.08/2.27
% 2.08/2.27 ======= end of input processing =======
% 2.08/2.27
% 2.08/2.27 =========== start of search ===========
% 2.08/2.27
% 2.08/2.27 -------- PROOF --------
% 2.08/2.27
% 2.08/2.27 -----> EMPTY CLAUSE at 0.27 sec ----> 1580 [hyper,1579,19,1578] $F.
% 2.08/2.27
% 2.08/2.27 Length of proof is 14. Level of proof is 10.
% 2.08/2.27
% 2.08/2.27 ---------------- PROOF ----------------
% 2.08/2.27 % SZS status Theorem
% 2.08/2.27 % SZS output start Refutation
% See solution above
% 2.08/2.27 ------------ end of proof -------------
% 2.08/2.27
% 2.08/2.27
% 2.08/2.27 Search stopped by max_proofs option.
% 2.08/2.27
% 2.08/2.27
% 2.08/2.27 Search stopped by max_proofs option.
% 2.08/2.27
% 2.08/2.27 ============ end of search ============
% 2.08/2.27
% 2.08/2.27 -------------- statistics -------------
% 2.08/2.27 clauses given 54
% 2.08/2.27 clauses generated 3935
% 2.08/2.27 clauses kept 1576
% 2.08/2.27 clauses forward subsumed 2705
% 2.08/2.27 clauses back subsumed 1238
% 2.08/2.27 Kbytes malloced 1953
% 2.08/2.27
% 2.08/2.27 ----------- times (seconds) -----------
% 2.08/2.27 user CPU time 0.27 (0 hr, 0 min, 0 sec)
% 2.08/2.27 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.08/2.27 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.08/2.27
% 2.08/2.27 That finishes the proof of the theorem.
% 2.08/2.27
% 2.08/2.27 Process 16829 finished Wed Jul 27 03:16:47 2022
% 2.08/2.27 Otter interrupted
% 2.08/2.27 PROOF FOUND
%------------------------------------------------------------------------------