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