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