TSTP Solution File: KRS075+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS075+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n024.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:04 EDT 2022
% Result : Unsatisfiable 1.80s 2.01s
% Output : Refutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 21 ( 12 unt; 0 nHn; 21 RR)
% Number of literals : 32 ( 4 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(21,axiom,
( ~ cUnsatisfiable(A)
| rf1(A,dollar_f1(A)) ),
file('KRS075+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ cUnsatisfiable(A)
| ~ cp(dollar_f1(A)) ),
file('KRS075+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ cUnsatisfiable(A)
| rs(A,dollar_f2(A)) ),
file('KRS075+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ cUnsatisfiable(A)
| rf(A,dollar_f3(A)) ),
file('KRS075+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ cUnsatisfiable(A)
| cp(dollar_f3(A)) ),
file('KRS075+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ rf(A,B)
| ~ rf(A,C)
| B = C ),
file('KRS075+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ rf1(A,B)
| ~ rf1(A,C)
| B = C ),
file('KRS075+1.p',unknown),
[] ).
cnf(37,axiom,
( ~ rs(A,B)
| rf1(A,B) ),
file('KRS075+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ rs(A,B)
| rf(A,B) ),
file('KRS075+1.p',unknown),
[] ).
cnf(45,axiom,
cUnsatisfiable(i2003_11_14_17_19_02584),
file('KRS075+1.p',unknown),
[] ).
cnf(46,plain,
cp(dollar_f3(i2003_11_14_17_19_02584)),
inference(hyper,[status(thm)],[45,26]),
[iquote('hyper,45,26')] ).
cnf(47,plain,
rf(i2003_11_14_17_19_02584,dollar_f3(i2003_11_14_17_19_02584)),
inference(hyper,[status(thm)],[45,25]),
[iquote('hyper,45,25')] ).
cnf(48,plain,
rs(i2003_11_14_17_19_02584,dollar_f2(i2003_11_14_17_19_02584)),
inference(hyper,[status(thm)],[45,23]),
[iquote('hyper,45,23')] ).
cnf(49,plain,
rf1(i2003_11_14_17_19_02584,dollar_f1(i2003_11_14_17_19_02584)),
inference(hyper,[status(thm)],[45,21]),
[iquote('hyper,45,21')] ).
cnf(69,plain,
rf(i2003_11_14_17_19_02584,dollar_f2(i2003_11_14_17_19_02584)),
inference(hyper,[status(thm)],[48,38]),
[iquote('hyper,48,38')] ).
cnf(70,plain,
rf1(i2003_11_14_17_19_02584,dollar_f2(i2003_11_14_17_19_02584)),
inference(hyper,[status(thm)],[48,37]),
[iquote('hyper,48,37')] ).
cnf(102,plain,
dollar_f3(i2003_11_14_17_19_02584) = dollar_f2(i2003_11_14_17_19_02584),
inference(hyper,[status(thm)],[69,28,47]),
[iquote('hyper,69,28,47')] ).
cnf(118,plain,
cp(dollar_f2(i2003_11_14_17_19_02584)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[46]),102]),
[iquote('back_demod,46,demod,102')] ).
cnf(130,plain,
dollar_f2(i2003_11_14_17_19_02584) = dollar_f1(i2003_11_14_17_19_02584),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[70,29,49])]),
[iquote('hyper,70,29,49,flip.1')] ).
cnf(131,plain,
cp(dollar_f1(i2003_11_14_17_19_02584)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[118]),130]),
[iquote('back_demod,118,demod,130')] ).
cnf(159,plain,
$false,
inference(hyper,[status(thm)],[131,22,45]),
[iquote('hyper,131,22,45')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS075+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.32 % Computer : n024.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Wed Jul 27 03:35:25 EDT 2022
% 0.12/0.32 % CPUTime :
% 1.80/2.01 ----- Otter 3.3f, August 2004 -----
% 1.80/2.01 The process was started by sandbox2 on n024.cluster.edu,
% 1.80/2.01 Wed Jul 27 03:35:25 2022
% 1.80/2.01 The command was "./otter". The process ID is 15527.
% 1.80/2.01
% 1.80/2.01 set(prolog_style_variables).
% 1.80/2.01 set(auto).
% 1.80/2.01 dependent: set(auto1).
% 1.80/2.01 dependent: set(process_input).
% 1.80/2.01 dependent: clear(print_kept).
% 1.80/2.01 dependent: clear(print_new_demod).
% 1.80/2.01 dependent: clear(print_back_demod).
% 1.80/2.01 dependent: clear(print_back_sub).
% 1.80/2.01 dependent: set(control_memory).
% 1.80/2.01 dependent: assign(max_mem, 12000).
% 1.80/2.01 dependent: assign(pick_given_ratio, 4).
% 1.80/2.01 dependent: assign(stats_level, 1).
% 1.80/2.01 dependent: assign(max_seconds, 10800).
% 1.80/2.01 clear(print_given).
% 1.80/2.01
% 1.80/2.01 formula_list(usable).
% 1.80/2.01 all A (A=A).
% 1.80/2.01 all A B (A=B&cUnsatisfiable(A)->cUnsatisfiable(B)).
% 1.80/2.01 all A B (A=B&cowlNothing(A)->cowlNothing(B)).
% 1.80/2.01 all A B (A=B&cowlThing(A)->cowlThing(B)).
% 1.80/2.01 all A B (A=B&cp(A)->cp(B)).
% 1.80/2.01 all A B C (A=B&rf(A,C)->rf(B,C)).
% 1.80/2.01 all A B C (A=B&rf(C,A)->rf(C,B)).
% 1.80/2.01 all A B C (A=B&rf1(A,C)->rf1(B,C)).
% 1.80/2.01 all A B C (A=B&rf1(C,A)->rf1(C,B)).
% 1.80/2.01 all A B C (A=B&rinvF(A,C)->rinvF(B,C)).
% 1.80/2.01 all A B C (A=B&rinvF(C,A)->rinvF(C,B)).
% 1.80/2.01 all A B C (A=B&rinvF1(A,C)->rinvF1(B,C)).
% 1.80/2.01 all A B C (A=B&rinvF1(C,A)->rinvF1(C,B)).
% 1.80/2.01 all A B C (A=B&rinvS(A,C)->rinvS(B,C)).
% 1.80/2.01 all A B C (A=B&rinvS(C,A)->rinvS(C,B)).
% 1.80/2.01 all A B C (A=B&rs(A,C)->rs(B,C)).
% 1.80/2.01 all A B C (A=B&rs(C,A)->rs(C,B)).
% 1.80/2.01 all A B (A=B&xsd_integer(A)->xsd_integer(B)).
% 1.80/2.01 all A B (A=B&xsd_string(A)->xsd_string(B)).
% 1.80/2.01 all X (cowlThing(X)& -cowlNothing(X)).
% 1.80/2.01 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.80/2.01 all X (cUnsatisfiable(X)<-> (exists Y (rf1(X,Y)& -cp(Y)))& (exists Y (rs(X,Y)&cowlThing(Y)))& (exists Y (rf(X,Y)&cp(Y)))).
% 1.80/2.01 all X Y Z (rf(X,Y)&rf(X,Z)->Y=Z).
% 1.80/2.01 all X Y Z (rf1(X,Y)&rf1(X,Z)->Y=Z).
% 1.80/2.01 all X Y (rinvF(X,Y)<->rf(Y,X)).
% 1.80/2.01 all X Y (rinvF1(X,Y)<->rf1(Y,X)).
% 1.80/2.01 all X Y (rinvS(X,Y)<->rs(Y,X)).
% 1.80/2.01 all X Y Z (rs(X,Y)&rs(X,Z)->Y=Z).
% 1.80/2.01 cUnsatisfiable(i2003_11_14_17_19_02584).
% 1.80/2.01 all X Y (rs(X,Y)->rf1(X,Y)).
% 1.80/2.01 all X Y (rs(X,Y)->rf(X,Y)).
% 1.80/2.01 end_of_list.
% 1.80/2.01
% 1.80/2.01 -------> usable clausifies to:
% 1.80/2.01
% 1.80/2.01 list(usable).
% 1.80/2.01 0 [] A=A.
% 1.80/2.01 0 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 1.80/2.01 0 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.80/2.01 0 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.80/2.01 0 [] A!=B| -cp(A)|cp(B).
% 1.80/2.01 0 [] A!=B| -rf(A,C)|rf(B,C).
% 1.80/2.01 0 [] A!=B| -rf(C,A)|rf(C,B).
% 1.80/2.01 0 [] A!=B| -rf1(A,C)|rf1(B,C).
% 1.80/2.01 0 [] A!=B| -rf1(C,A)|rf1(C,B).
% 1.80/2.01 0 [] A!=B| -rinvF(A,C)|rinvF(B,C).
% 1.80/2.01 0 [] A!=B| -rinvF(C,A)|rinvF(C,B).
% 1.80/2.01 0 [] A!=B| -rinvF1(A,C)|rinvF1(B,C).
% 1.80/2.01 0 [] A!=B| -rinvF1(C,A)|rinvF1(C,B).
% 1.80/2.01 0 [] A!=B| -rinvS(A,C)|rinvS(B,C).
% 1.80/2.01 0 [] A!=B| -rinvS(C,A)|rinvS(C,B).
% 1.80/2.01 0 [] A!=B| -rs(A,C)|rs(B,C).
% 1.80/2.01 0 [] A!=B| -rs(C,A)|rs(C,B).
% 1.80/2.01 0 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.80/2.01 0 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.80/2.01 0 [] cowlThing(X).
% 1.80/2.01 0 [] -cowlNothing(X).
% 1.80/2.01 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.80/2.01 0 [] xsd_string(X)|xsd_integer(X).
% 1.80/2.01 0 [] -cUnsatisfiable(X)|rf1(X,$f1(X)).
% 1.80/2.01 0 [] -cUnsatisfiable(X)| -cp($f1(X)).
% 1.80/2.01 0 [] -cUnsatisfiable(X)|rs(X,$f2(X)).
% 1.80/2.01 0 [] -cUnsatisfiable(X)|cowlThing($f2(X)).
% 1.80/2.01 0 [] -cUnsatisfiable(X)|rf(X,$f3(X)).
% 1.80/2.01 0 [] -cUnsatisfiable(X)|cp($f3(X)).
% 1.80/2.01 0 [] cUnsatisfiable(X)| -rf1(X,Y)|cp(Y)| -rs(X,X1)| -cowlThing(X1)| -rf(X,X2)| -cp(X2).
% 1.80/2.01 0 [] -rf(X,Y)| -rf(X,Z)|Y=Z.
% 1.80/2.01 0 [] -rf1(X,Y)| -rf1(X,Z)|Y=Z.
% 1.80/2.01 0 [] -rinvF(X,Y)|rf(Y,X).
% 1.80/2.01 0 [] rinvF(X,Y)| -rf(Y,X).
% 1.80/2.01 0 [] -rinvF1(X,Y)|rf1(Y,X).
% 1.80/2.01 0 [] rinvF1(X,Y)| -rf1(Y,X).
% 1.80/2.01 0 [] -rinvS(X,Y)|rs(Y,X).
% 1.80/2.01 0 [] rinvS(X,Y)| -rs(Y,X).
% 1.80/2.01 0 [] -rs(X,Y)| -rs(X,Z)|Y=Z.
% 1.80/2.01 0 [] cUnsatisfiable(i2003_11_14_17_19_02584).
% 1.80/2.01 0 [] -rs(X,Y)|rf1(X,Y).
% 1.80/2.01 0 [] -rs(X,Y)|rf(X,Y).
% 1.80/2.01 end_of_list.
% 1.80/2.01
% 1.80/2.01 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 1.80/2.01
% 1.80/2.01 This ia a non-Horn set with equality. The strategy will be
% 1.80/2.01 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.80/2.01 deletion, with positive clauses in sos and nonpositive
% 1.80/2.01 clauses in usable.
% 1.80/2.01
% 1.80/2.01 dependent: set(knuth_bendix).
% 1.80/2.01 dependent: set(anl_eq).
% 1.80/2.01 dependent: set(para_from).
% 1.80/2.01 dependent: set(para_into).
% 1.80/2.01 dependent: clear(para_from_right).
% 1.80/2.01 dependent: clear(para_into_right).
% 1.80/2.01 dependent: set(para_from_vars).
% 1.80/2.01 dependent: set(eq_units_both_ways).
% 1.80/2.01 dependent: set(dynamic_demod_all).
% 1.80/2.01 dependent: set(dynamic_demod).
% 1.80/2.01 dependent: set(order_eq).
% 1.80/2.01 dependent: set(back_demod).
% 1.80/2.01 dependent: set(lrpo).
% 1.80/2.01 dependent: set(hyper_res).
% 1.80/2.01 dependent: set(unit_deletion).
% 1.80/2.01 dependent: set(factor).
% 1.80/2.01
% 1.80/2.01 ------------> process usable:
% 1.80/2.01 ** KEPT (pick-wt=7): 1 [] A!=B| -cUnsatisfiable(A)|cUnsatisfiable(B).
% 1.80/2.01 ** KEPT (pick-wt=7): 2 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.80/2.01 ** KEPT (pick-wt=7): 3 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.80/2.01 ** KEPT (pick-wt=7): 4 [] A!=B| -cp(A)|cp(B).
% 1.80/2.01 ** KEPT (pick-wt=9): 5 [] A!=B| -rf(A,C)|rf(B,C).
% 1.80/2.01 ** KEPT (pick-wt=9): 6 [] A!=B| -rf(C,A)|rf(C,B).
% 1.80/2.01 ** KEPT (pick-wt=9): 7 [] A!=B| -rf1(A,C)|rf1(B,C).
% 1.80/2.01 ** KEPT (pick-wt=9): 8 [] A!=B| -rf1(C,A)|rf1(C,B).
% 1.80/2.01 ** KEPT (pick-wt=9): 9 [] A!=B| -rinvF(A,C)|rinvF(B,C).
% 1.80/2.01 ** KEPT (pick-wt=9): 10 [] A!=B| -rinvF(C,A)|rinvF(C,B).
% 1.80/2.01 ** KEPT (pick-wt=9): 11 [] A!=B| -rinvF1(A,C)|rinvF1(B,C).
% 1.80/2.01 ** KEPT (pick-wt=9): 12 [] A!=B| -rinvF1(C,A)|rinvF1(C,B).
% 1.80/2.01 ** KEPT (pick-wt=9): 13 [] A!=B| -rinvS(A,C)|rinvS(B,C).
% 1.80/2.01 ** KEPT (pick-wt=9): 14 [] A!=B| -rinvS(C,A)|rinvS(C,B).
% 1.80/2.01 ** KEPT (pick-wt=9): 15 [] A!=B| -rs(A,C)|rs(B,C).
% 1.80/2.01 ** KEPT (pick-wt=9): 16 [] A!=B| -rs(C,A)|rs(C,B).
% 1.80/2.01 ** KEPT (pick-wt=7): 17 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.80/2.01 ** KEPT (pick-wt=7): 18 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.80/2.01 ** KEPT (pick-wt=2): 19 [] -cowlNothing(A).
% 1.80/2.01 ** KEPT (pick-wt=4): 20 [] -xsd_string(A)| -xsd_integer(A).
% 1.80/2.01 ** KEPT (pick-wt=6): 21 [] -cUnsatisfiable(A)|rf1(A,$f1(A)).
% 1.80/2.01 ** KEPT (pick-wt=5): 22 [] -cUnsatisfiable(A)| -cp($f1(A)).
% 1.80/2.01 ** KEPT (pick-wt=6): 23 [] -cUnsatisfiable(A)|rs(A,$f2(A)).
% 1.80/2.01 ** KEPT (pick-wt=5): 24 [] -cUnsatisfiable(A)|cowlThing($f2(A)).
% 1.80/2.01 ** KEPT (pick-wt=6): 25 [] -cUnsatisfiable(A)|rf(A,$f3(A)).
% 1.80/2.01 ** KEPT (pick-wt=5): 26 [] -cUnsatisfiable(A)|cp($f3(A)).
% 1.80/2.01 ** KEPT (pick-wt=17): 27 [] cUnsatisfiable(A)| -rf1(A,B)|cp(B)| -rs(A,C)| -cowlThing(C)| -rf(A,D)| -cp(D).
% 1.80/2.01 ** KEPT (pick-wt=9): 28 [] -rf(A,B)| -rf(A,C)|B=C.
% 1.80/2.01 ** KEPT (pick-wt=9): 29 [] -rf1(A,B)| -rf1(A,C)|B=C.
% 1.80/2.01 ** KEPT (pick-wt=6): 30 [] -rinvF(A,B)|rf(B,A).
% 1.80/2.01 ** KEPT (pick-wt=6): 31 [] rinvF(A,B)| -rf(B,A).
% 1.80/2.01 ** KEPT (pick-wt=6): 32 [] -rinvF1(A,B)|rf1(B,A).
% 1.80/2.01 ** KEPT (pick-wt=6): 33 [] rinvF1(A,B)| -rf1(B,A).
% 1.80/2.01 ** KEPT (pick-wt=6): 34 [] -rinvS(A,B)|rs(B,A).
% 1.80/2.01 ** KEPT (pick-wt=6): 35 [] rinvS(A,B)| -rs(B,A).
% 1.80/2.01 ** KEPT (pick-wt=9): 36 [] -rs(A,B)| -rs(A,C)|B=C.
% 1.80/2.01 ** KEPT (pick-wt=6): 37 [] -rs(A,B)|rf1(A,B).
% 1.80/2.01 ** KEPT (pick-wt=6): 38 [] -rs(A,B)|rf(A,B).
% 1.80/2.01 19 back subsumes 2.
% 1.80/2.01
% 1.80/2.01 ------------> process sos:
% 1.80/2.01 ** KEPT (pick-wt=3): 42 [] A=A.
% 1.80/2.01 ** KEPT (pick-wt=2): 43 [] cowlThing(A).
% 1.80/2.01 ** KEPT (pick-wt=4): 44 [] xsd_string(A)|xsd_integer(A).
% 1.80/2.01 ** KEPT (pick-wt=2): 45 [] cUnsatisfiable(i2003_11_14_17_19_02584).
% 1.80/2.01 Following clause subsumed by 42 during input processing: 0 [copy,42,flip.1] A=A.
% 1.80/2.01 42 back subsumes 41.
% 1.80/2.01 42 back subsumes 40.
% 1.80/2.01 42 back subsumes 39.
% 1.80/2.01 43 back subsumes 24.
% 1.80/2.01 43 back subsumes 3.
% 1.80/2.01
% 1.80/2.01 ======= end of input processing =======
% 1.80/2.01
% 1.80/2.01 =========== start of search ===========
% 1.80/2.01
% 1.80/2.01 -------- PROOF --------
% 1.80/2.01
% 1.80/2.01 -----> EMPTY CLAUSE at 0.01 sec ----> 159 [hyper,131,22,45] $F.
% 1.80/2.01
% 1.80/2.01 Length of proof is 10. Level of proof is 5.
% 1.80/2.01
% 1.80/2.01 ---------------- PROOF ----------------
% 1.80/2.01 % SZS status Theorem
% 1.80/2.01 % SZS output start Refutation
% See solution above
% 1.80/2.01 ------------ end of proof -------------
% 1.80/2.01
% 1.80/2.01
% 1.80/2.01 Search stopped by max_proofs option.
% 1.80/2.01
% 1.80/2.01
% 1.80/2.01 Search stopped by max_proofs option.
% 1.80/2.01
% 1.80/2.01 ============ end of search ============
% 1.80/2.01
% 1.80/2.01 -------------- statistics -------------
% 1.80/2.01 clauses given 14
% 1.80/2.01 clauses generated 209
% 1.80/2.01 clauses kept 155
% 1.80/2.01 clauses forward subsumed 143
% 1.80/2.01 clauses back subsumed 6
% 1.80/2.01 Kbytes malloced 976
% 1.80/2.01
% 1.80/2.01 ----------- times (seconds) -----------
% 1.80/2.01 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.80/2.01 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.80/2.01 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.80/2.01
% 1.80/2.01 That finishes the proof of the theorem.
% 1.80/2.01
% 1.80/2.01 Process 15527 finished Wed Jul 27 03:35:26 2022
% 1.80/2.01 Otter interrupted
% 1.80/2.01 PROOF FOUND
%------------------------------------------------------------------------------