TSTP Solution File: KRS125+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS125+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n011.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:12 EDT 2022
% Result : Unsatisfiable 1.92s 2.10s
% Output : Refutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 8 unt; 0 nHn; 15 RR)
% Number of literals : 22 ( 0 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 8 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( ~ cUnsatisfiable(A)
| ce3(A) ),
file('KRS125+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ cUnsatisfiable(A)
| cf(A) ),
file('KRS125+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ cc(A)
| cdxcomp(A) ),
file('KRS125+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ cd(A)
| ~ ra_Px1(A,B) ),
file('KRS125+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ cdxcomp(A)
| ra_Px1(A,dollar_f2(A)) ),
file('KRS125+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ ce3(A)
| cc(A) ),
file('KRS125+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ cf(A)
| cd(A) ),
file('KRS125+1.p',unknown),
[] ).
cnf(21,axiom,
cUnsatisfiable(i2003_11_14_17_22_17947),
file('KRS125+1.p',unknown),
[] ).
cnf(22,plain,
cf(i2003_11_14_17_22_17947),
inference(hyper,[status(thm)],[21,4]),
[iquote('hyper,21,4')] ).
cnf(23,plain,
ce3(i2003_11_14_17_22_17947),
inference(hyper,[status(thm)],[21,3]),
[iquote('hyper,21,3')] ).
cnf(24,plain,
cd(i2003_11_14_17_22_17947),
inference(hyper,[status(thm)],[22,16]),
[iquote('hyper,22,16')] ).
cnf(25,plain,
cc(i2003_11_14_17_22_17947),
inference(hyper,[status(thm)],[23,15]),
[iquote('hyper,23,15')] ).
cnf(26,plain,
cdxcomp(i2003_11_14_17_22_17947),
inference(hyper,[status(thm)],[25,6]),
[iquote('hyper,25,6')] ).
cnf(27,plain,
ra_Px1(i2003_11_14_17_22_17947,dollar_f2(i2003_11_14_17_22_17947)),
inference(hyper,[status(thm)],[26,10]),
[iquote('hyper,26,10')] ).
cnf(28,plain,
$false,
inference(hyper,[status(thm)],[27,9,24]),
[iquote('hyper,27,9,24')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS125+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n011.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:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.92/2.10 ----- Otter 3.3f, August 2004 -----
% 1.92/2.10 The process was started by sandbox on n011.cluster.edu,
% 1.92/2.10 Wed Jul 27 03:28:10 2022
% 1.92/2.10 The command was "./otter". The process ID is 26384.
% 1.92/2.10
% 1.92/2.10 set(prolog_style_variables).
% 1.92/2.10 set(auto).
% 1.92/2.10 dependent: set(auto1).
% 1.92/2.10 dependent: set(process_input).
% 1.92/2.10 dependent: clear(print_kept).
% 1.92/2.10 dependent: clear(print_new_demod).
% 1.92/2.10 dependent: clear(print_back_demod).
% 1.92/2.10 dependent: clear(print_back_sub).
% 1.92/2.10 dependent: set(control_memory).
% 1.92/2.10 dependent: assign(max_mem, 12000).
% 1.92/2.10 dependent: assign(pick_given_ratio, 4).
% 1.92/2.10 dependent: assign(stats_level, 1).
% 1.92/2.10 dependent: assign(max_seconds, 10800).
% 1.92/2.10 clear(print_given).
% 1.92/2.10
% 1.92/2.10 formula_list(usable).
% 1.92/2.10 all X (cowlThing(X)& -cowlNothing(X)).
% 1.92/2.10 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.92/2.10 all X (cUnsatisfiable(X)<->ce3(X)&cf(X)).
% 1.92/2.10 all X (cc(X)->cdxcomp(X)).
% 1.92/2.10 all X (cc1(X)->cd1xcomp(X)).
% 1.92/2.10 all X (cc1(X)->cd1(X)).
% 1.92/2.10 all X (cd(X)<-> -(exists Y ra_Px1(X,Y))).
% 1.92/2.10 all X (cdxcomp(X)<-> (exists Y0 ra_Px1(X,Y0))).
% 1.92/2.10 all X (cd1(X)<-> (exists Y0 ra_Px2(X,Y0))).
% 1.92/2.10 all X (cd1xcomp(X)<-> -(exists Y ra_Px2(X,Y))).
% 1.92/2.10 all X (ce3(X)->cc(X)).
% 1.92/2.10 all X (cf(X)->cd(X)).
% 1.92/2.10 cUnsatisfiable(i2003_11_14_17_22_17947).
% 1.92/2.10 end_of_list.
% 1.92/2.10
% 1.92/2.10 -------> usable clausifies to:
% 1.92/2.10
% 1.92/2.10 list(usable).
% 1.92/2.10 0 [] cowlThing(X).
% 1.92/2.10 0 [] -cowlNothing(X).
% 1.92/2.10 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.92/2.10 0 [] xsd_string(X)|xsd_integer(X).
% 1.92/2.10 0 [] -cUnsatisfiable(X)|ce3(X).
% 1.92/2.10 0 [] -cUnsatisfiable(X)|cf(X).
% 1.92/2.10 0 [] cUnsatisfiable(X)| -ce3(X)| -cf(X).
% 1.92/2.10 0 [] -cc(X)|cdxcomp(X).
% 1.92/2.10 0 [] -cc1(X)|cd1xcomp(X).
% 1.92/2.10 0 [] -cc1(X)|cd1(X).
% 1.92/2.10 0 [] -cd(X)| -ra_Px1(X,Y).
% 1.92/2.10 0 [] cd(X)|ra_Px1(X,$f1(X)).
% 1.92/2.10 0 [] -cdxcomp(X)|ra_Px1(X,$f2(X)).
% 1.92/2.10 0 [] cdxcomp(X)| -ra_Px1(X,Y0).
% 1.92/2.10 0 [] -cd1(X)|ra_Px2(X,$f3(X)).
% 1.92/2.10 0 [] cd1(X)| -ra_Px2(X,Y0).
% 1.92/2.10 0 [] -cd1xcomp(X)| -ra_Px2(X,Y).
% 1.92/2.10 0 [] cd1xcomp(X)|ra_Px2(X,$f4(X)).
% 1.92/2.10 0 [] -ce3(X)|cc(X).
% 1.92/2.10 0 [] -cf(X)|cd(X).
% 1.92/2.10 0 [] cUnsatisfiable(i2003_11_14_17_22_17947).
% 1.92/2.10 end_of_list.
% 1.92/2.10
% 1.92/2.10 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.92/2.10
% 1.92/2.10 This is a non-Horn set without equality. The strategy will
% 1.92/2.10 be ordered hyper_res, unit deletion, and factoring, with
% 1.92/2.10 satellites in sos and with nuclei in usable.
% 1.92/2.10
% 1.92/2.10 dependent: set(hyper_res).
% 1.92/2.10 dependent: set(factor).
% 1.92/2.10 dependent: set(unit_deletion).
% 1.92/2.10
% 1.92/2.10 ------------> process usable:
% 1.92/2.10 ** KEPT (pick-wt=2): 1 [] -cowlNothing(A).
% 1.92/2.10 ** KEPT (pick-wt=4): 2 [] -xsd_string(A)| -xsd_integer(A).
% 1.92/2.10 ** KEPT (pick-wt=4): 3 [] -cUnsatisfiable(A)|ce3(A).
% 1.92/2.10 ** KEPT (pick-wt=4): 4 [] -cUnsatisfiable(A)|cf(A).
% 1.92/2.10 ** KEPT (pick-wt=6): 5 [] cUnsatisfiable(A)| -ce3(A)| -cf(A).
% 1.92/2.10 ** KEPT (pick-wt=4): 6 [] -cc(A)|cdxcomp(A).
% 1.92/2.10 ** KEPT (pick-wt=4): 7 [] -cc1(A)|cd1xcomp(A).
% 1.92/2.10 ** KEPT (pick-wt=4): 8 [] -cc1(A)|cd1(A).
% 1.92/2.10 ** KEPT (pick-wt=5): 9 [] -cd(A)| -ra_Px1(A,B).
% 1.92/2.10 ** KEPT (pick-wt=6): 10 [] -cdxcomp(A)|ra_Px1(A,$f2(A)).
% 1.92/2.10 ** KEPT (pick-wt=5): 11 [] cdxcomp(A)| -ra_Px1(A,B).
% 1.92/2.10 ** KEPT (pick-wt=6): 12 [] -cd1(A)|ra_Px2(A,$f3(A)).
% 1.92/2.10 ** KEPT (pick-wt=5): 13 [] cd1(A)| -ra_Px2(A,B).
% 1.92/2.10 ** KEPT (pick-wt=5): 14 [] -cd1xcomp(A)| -ra_Px2(A,B).
% 1.92/2.10 ** KEPT (pick-wt=4): 15 [] -ce3(A)|cc(A).
% 1.92/2.10 ** KEPT (pick-wt=4): 16 [] -cf(A)|cd(A).
% 1.92/2.10
% 1.92/2.10 ------------> process sos:
% 1.92/2.10 ** KEPT (pick-wt=2): 17 [] cowlThing(A).
% 1.92/2.10 ** KEPT (pick-wt=4): 18 [] xsd_string(A)|xsd_integer(A).
% 1.92/2.10 ** KEPT (pick-wt=6): 19 [] cd(A)|ra_Px1(A,$f1(A)).
% 1.92/2.10 ** KEPT (pick-wt=6): 20 [] cd1xcomp(A)|ra_Px2(A,$f4(A)).
% 1.92/2.10 ** KEPT (pick-wt=2): 21 [] cUnsatisfiable(i2003_11_14_17_22_17947).
% 1.92/2.10
% 1.92/2.10 ======= end of input processing =======
% 1.92/2.10
% 1.92/2.10 =========== start of search ===========
% 1.92/2.10
% 1.92/2.10 -------- PROOF --------
% 1.92/2.10
% 1.92/2.10 -----> EMPTY CLAUSE at 0.00 sec ----> 28 [hyper,27,9,24] $F.
% 1.92/2.10
% 1.92/2.10 Length of proof is 6. Level of proof is 4.
% 1.92/2.10
% 1.92/2.10 ---------------- PROOF ----------------
% 1.92/2.10 % SZS status Theorem
% 1.92/2.10 % SZS output start Refutation
% See solution above
% 1.92/2.10 ------------ end of proof -------------
% 1.92/2.10
% 1.92/2.10
% 1.92/2.10 Search stopped by max_proofs option.
% 1.92/2.10
% 1.92/2.10
% 1.92/2.10 Search stopped by max_proofs option.
% 1.92/2.10
% 1.92/2.10 ============ end of search ============
% 1.92/2.10
% 1.92/2.10 -------------- statistics -------------
% 1.92/2.10 clauses given 9
% 1.92/2.10 clauses generated 9
% 1.92/2.10 clauses kept 27
% 1.92/2.10 clauses forward subsumed 2
% 1.92/2.10 clauses back subsumed 0
% 1.92/2.10 Kbytes malloced 976
% 1.92/2.10
% 1.92/2.10 ----------- times (seconds) -----------
% 1.92/2.10 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.10 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.10 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.92/2.10
% 1.92/2.10 That finishes the proof of the theorem.
% 1.92/2.10
% 1.92/2.10 Process 26384 finished Wed Jul 27 03:28:12 2022
% 1.92/2.10 Otter interrupted
% 1.92/2.10 PROOF FOUND
%------------------------------------------------------------------------------