%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS180+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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:31 EDT 2022
% Result : Theorem 1.94s 2.14s
% Output : Refutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 11 ( 5 unt; 2 nHn; 9 RR)
% Number of literals : 21 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 18 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
( ~ status(A,B,C)
| status(A,B,D)
| ~ isa(C,D) ),
file('KRS180+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ status(dollar_f6(A,B),dollar_f5(A,B),B)
| ~ nota(A,B) ),
file('KRS180+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ status(A,B,C)
| ~ status(A,B,D)
| ~ nevera(C,D) ),
file('KRS180+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ status(A,B,C)
| ~ status(A,B,D)
| ~ xora(C,D) ),
file('KRS180+1.p',unknown),
[] ).
cnf(38,axiom,
status(A,B,dollar_c20),
file('KRS180+1.p',unknown),
[] ).
cnf(39,axiom,
isa(dollar_c20,dollar_c19),
file('KRS180+1.p',unknown),
[] ).
cnf(40,axiom,
( nota(dollar_c20,dollar_c19)
| nevera(dollar_c20,dollar_c19)
| xora(dollar_c20,dollar_c19) ),
file('KRS180+1.p',unknown),
[] ).
cnf(46,plain,
status(A,B,dollar_c19),
inference(hyper,[status(thm)],[38,5,39]),
[iquote('hyper,38,5,39')] ).
cnf(72,plain,
( nota(dollar_c20,dollar_c19)
| nevera(dollar_c20,dollar_c19) ),
inference(hyper,[status(thm)],[40,13,38,46]),
[iquote('hyper,40,13,38,46')] ).
cnf(91,plain,
nevera(dollar_c20,dollar_c19),
inference(hyper,[status(thm)],[72,8,46]),
[iquote('hyper,72,8,46')] ).
cnf(92,plain,
$false,
inference(hyper,[status(thm)],[91,9,38,46]),
[iquote('hyper,91,9,38,46')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : KRS180+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 03:26:02 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.94/2.14 ----- Otter 3.3f, August 2004 -----
% 1.94/2.14 The process was started by sandbox2 on n006.cluster.edu,
% 1.94/2.14 Wed Jul 27 03:26:02 2022
% 1.94/2.14 The command was "./otter". The process ID is 926.
% 1.94/2.14
% 1.94/2.14 set(prolog_style_variables).
% 1.94/2.14 set(auto).
% 1.94/2.14 dependent: set(auto1).
% 1.94/2.14 dependent: set(process_input).
% 1.94/2.14 dependent: clear(print_kept).
% 1.94/2.14 dependent: clear(print_new_demod).
% 1.94/2.14 dependent: clear(print_back_demod).
% 1.94/2.14 dependent: clear(print_back_sub).
% 1.94/2.14 dependent: set(control_memory).
% 1.94/2.14 dependent: assign(max_mem, 12000).
% 1.94/2.14 dependent: assign(pick_given_ratio, 4).
% 1.94/2.14 dependent: assign(stats_level, 1).
% 1.94/2.14 dependent: assign(max_seconds, 10800).
% 1.94/2.14 clear(print_given).
% 1.94/2.14
% 1.94/2.14 formula_list(usable).
% 1.94/2.14 all S1 S2 ((exists Ax C (status(Ax,C,S1)&status(Ax,C,S2)))<->mighta(S1,S2)).
% 1.94/2.14 all S1 S2 ((all Ax C (status(Ax,C,S1)->status(Ax,C,S2)))<->isa(S1,S2)).
% 1.94/2.14 all S1 S2 ((exists Ax C (status(Ax,C,S1)& -status(Ax,C,S2)))<->nota(S1,S2)).
% 1.94/2.14 all S1 S2 ((all Ax C (status(Ax,C,S1)-> -status(Ax,C,S2)))<->nevera(S1,S2)).
% 1.94/2.14 all S1 S2 ((all Ax C (-(status(Ax,C,S1)<->status(Ax,C,S2))))<->xora(S1,S2)).
% 1.94/2.14 all I F (-(model(I,F)<->model(I,not(F)))).
% 1.94/2.14 all I F (model(I,F)<-> -model(I,not(F))).
% 1.94/2.14 exists F all I model(I,F).
% 1.94/2.14 exists F ((exists I1 model(I1,F))& (exists I2 (-model(I2,F)))).
% 1.94/2.14 exists F all I (-model(I,F)).
% 1.94/2.14 exists Ax C ((exists I1 (model(I1,Ax)&model(I1,C)))& (exists I2 (-model(I2,Ax)| -model(I2,C)))).
% 1.94/2.14 exists Ax C ((exists I1 model(I1,Ax))& (all I2 (model(I2,Ax)->model(I2,C)))& (exists I3 (-model(I3,Ax)&model(I3,C)))& (exists I4 (-model(I4,C)))).
% 1.94/2.14 exists I1 Ax C (model(I1,Ax)& -model(I1,C)& (exists I2 model(I2,C))).
% 1.94/2.14 -(all S1 S2 exists Ax C (status(Ax,C,S1)-> -(isa(S1,S2)& (nota(S1,S2)|nevera(S1,S2)|xora(S1,S2))))).
% 1.94/2.14 end_of_list.
% 1.94/2.14
% 1.94/2.14 -------> usable clausifies to:
% 1.94/2.14
% 1.94/2.14 list(usable).
% 1.94/2.14 0 [] -status(Ax,C,S1)| -status(Ax,C,S2)|mighta(S1,S2).
% 1.94/2.14 0 [] status($f2(S1,S2),$f1(S1,S2),S1)| -mighta(S1,S2).
% 1.94/2.14 0 [] status($f2(S1,S2),$f1(S1,S2),S2)| -mighta(S1,S2).
% 1.94/2.14 0 [] status($f4(S1,S2),$f3(S1,S2),S1)|isa(S1,S2).
% 1.94/2.14 0 [] -status($f4(S1,S2),$f3(S1,S2),S2)|isa(S1,S2).
% 1.94/2.14 0 [] -status(Ax,C,S1)|status(Ax,C,S2)| -isa(S1,S2).
% 1.94/2.14 0 [] -status(Ax,C,S1)|status(Ax,C,S2)|nota(S1,S2).
% 1.94/2.14 0 [] status($f6(S1,S2),$f5(S1,S2),S1)| -nota(S1,S2).
% 1.94/2.14 0 [] -status($f6(S1,S2),$f5(S1,S2),S2)| -nota(S1,S2).
% 1.94/2.14 0 [] status($f8(S1,S2),$f7(S1,S2),S1)|nevera(S1,S2).
% 1.94/2.14 0 [] status($f8(S1,S2),$f7(S1,S2),S2)|nevera(S1,S2).
% 1.94/2.14 0 [] -status(Ax,C,S1)| -status(Ax,C,S2)| -nevera(S1,S2).
% 1.94/2.14 0 [] -status($f10(S1,S2),$f9(S1,S2),S1)|status($f10(S1,S2),$f9(S1,S2),S2)|xora(S1,S2).
% 1.94/2.14 0 [] status($f10(S1,S2),$f9(S1,S2),S1)| -status($f10(S1,S2),$f9(S1,S2),S2)|xora(S1,S2).
% 1.94/2.14 0 [] status(Ax,C,S1)|status(Ax,C,S2)| -xora(S1,S2).
% 1.94/2.14 0 [] -status(Ax,C,S1)| -status(Ax,C,S2)| -xora(S1,S2).
% 1.94/2.14 0 [] model(I,F)|model(I,not(F)).
% 1.94/2.14 0 [] -model(I,F)| -model(I,not(F)).
% 1.94/2.14 0 [] -model(I,F)| -model(I,not(F)).
% 1.94/2.14 0 [] model(I,F)|model(I,not(F)).
% 1.94/2.14 0 [] model(I,$c1).
% 1.94/2.14 0 [] model($c2,$c4).
% 1.94/2.14 0 [] -model($c3,$c4).
% 1.94/2.14 0 [] -model(I,$c5).
% 1.94/2.14 0 [] model($c6,$c9).
% 1.94/2.14 0 [] model($c6,$c8).
% 1.94/2.14 0 [] -model($c7,$c9)| -model($c7,$c8).
% 1.94/2.14 0 [] model($c10,$c14).
% 1.94/2.14 0 [] -model(I2,$c14)|model(I2,$c13).
% 1.94/2.14 0 [] -model($c11,$c14).
% 1.94/2.14 0 [] model($c11,$c13).
% 1.94/2.14 0 [] -model($c12,$c13).
% 1.94/2.14 0 [] model($c18,$c17).
% 1.94/2.14 0 [] -model($c18,$c16).
% 1.94/2.14 0 [] model($c15,$c16).
% 1.94/2.14 0 [] status(Ax,C,$c20).
% 1.94/2.14 0 [] isa($c20,$c19).
% 1.94/2.14 0 [] nota($c20,$c19)|nevera($c20,$c19)|xora($c20,$c19).
% 1.94/2.14 end_of_list.
% 1.94/2.14
% 1.94/2.14 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.94/2.14
% 1.94/2.14 This is a non-Horn set without equality. The strategy will
% 1.94/2.14 be ordered hyper_res, unit deletion, and factoring, with
% 1.94/2.14 satellites in sos and with nuclei in usable.
% 1.94/2.14
% 1.94/2.14 dependent: set(hyper_res).
% 1.94/2.14 dependent: set(factor).
% 1.94/2.14 dependent: set(unit_deletion).
% 1.94/2.14
% 1.94/2.14 ------------> process usable:
% 1.94/2.14 ** KEPT (pick-wt=11): 1 [] -status(A,B,C)| -status(A,B,D)|mighta(C,D).
% 1.94/2.14 ** KEPT (pick-wt=11): 2 [] status($f2(A,B),$f1(A,B),A)| -mighta(A,B).
% 1.94/2.14 ** KEPT (pick-wt=11): 3 [] status($f2(A,B),$f1(A,B),B)| -mighta(A,B).
% 1.94/2.14 ** KEPT (pick-wt=11): 4 [] -status($f4(A,B),$f3(A,B),B)|isa(A,B).
% 1.94/2.14 ** KEPT (pick-wt=11): 5 [] -status(A,B,C)|status(A,B,D)| -isa(C,D).
% 1.94/2.14 ** KEPT (pick-wt=11): 6 [] -status(A,B,C)|status(A,B,D)|nota(C,D).
% 1.94/2.14 ** KEPT (pick-wt=11): 7 [] status($f6(A,B),$f5(A,B),A)| -nota(A,B).
% 1.94/2.14 ** KEPT (pick-wt=11): 8 [] -status($f6(A,B),$f5(A,B),B)| -nota(A,B).
% 1.94/2.14 ** KEPT (pick-wt=11): 9 [] -status(A,B,C)| -status(A,B,D)| -nevera(C,D).
% 1.94/2.14 ** KEPT (pick-wt=19): 10 [] -status($f10(A,B),$f9(A,B),A)|status($f10(A,B),$f9(A,B),B)|xora(A,B).
% 1.94/2.14 ** KEPT (pick-wt=19): 11 [] status($f10(A,B),$f9(A,B),A)| -status($f10(A,B),$f9(A,B),B)|xora(A,B).
% 1.94/2.14 ** KEPT (pick-wt=11): 12 [] status(A,B,C)|status(A,B,D)| -xora(C,D).
% 1.94/2.14 ** KEPT (pick-wt=11): 13 [] -status(A,B,C)| -status(A,B,D)| -xora(C,D).
% 1.94/2.14 ** KEPT (pick-wt=7): 14 [] -model(A,B)| -model(A,not(B)).
% 1.94/2.14 Following clause subsumed by 14 during input processing: 0 [] -model(A,B)| -model(A,not(B)).
% 1.94/2.14 ** KEPT (pick-wt=3): 15 [] -model($c3,$c4).
% 1.94/2.14 ** KEPT (pick-wt=3): 16 [] -model(A,$c5).
% 1.94/2.14 ** KEPT (pick-wt=6): 17 [] -model($c7,$c9)| -model($c7,$c8).
% 1.94/2.14 ** KEPT (pick-wt=6): 18 [] -model(A,$c14)|model(A,$c13).
% 1.94/2.14 ** KEPT (pick-wt=3): 19 [] -model($c11,$c14).
% 1.94/2.14 ** KEPT (pick-wt=3): 20 [] -model($c12,$c13).
% 1.94/2.14 ** KEPT (pick-wt=3): 21 [] -model($c18,$c16).
% 1.94/2.14
% 1.94/2.14 ------------> process sos:
% 1.94/2.14 ** KEPT (pick-wt=11): 26 [] status($f4(A,B),$f3(A,B),A)|isa(A,B).
% 1.94/2.14 ** KEPT (pick-wt=11): 27 [] status($f8(A,B),$f7(A,B),A)|nevera(A,B).
% 1.94/2.14 ** KEPT (pick-wt=11): 28 [] status($f8(A,B),$f7(A,B),B)|nevera(A,B).
% 1.94/2.14 ** KEPT (pick-wt=7): 29 [] model(A,B)|model(A,not(B)).
% 1.94/2.14 Following clause subsumed by 29 during input processing: 0 [] model(A,B)|model(A,not(B)).
% 1.94/2.14 ** KEPT (pick-wt=3): 30 [] model(A,$c1).
% 1.94/2.14 ** KEPT (pick-wt=3): 31 [] model($c2,$c4).
% 1.94/2.14 ** KEPT (pick-wt=3): 32 [] model($c6,$c9).
% 1.94/2.14 ** KEPT (pick-wt=3): 33 [] model($c6,$c8).
% 1.94/2.14 ** KEPT (pick-wt=3): 34 [] model($c10,$c14).
% 1.94/2.14 ** KEPT (pick-wt=3): 35 [] model($c11,$c13).
% 1.94/2.14 ** KEPT (pick-wt=3): 36 [] model($c18,$c17).
% 1.94/2.14 ** KEPT (pick-wt=3): 37 [] model($c15,$c16).
% 1.94/2.14 ** KEPT (pick-wt=4): 38 [] status(A,B,$c20).
% 1.94/2.14 ** KEPT (pick-wt=3): 39 [] isa($c20,$c19).
% 1.94/2.14 ** KEPT (pick-wt=9): 40 [] nota($c20,$c19)|nevera($c20,$c19)|xora($c20,$c19).
% 1.94/2.14
% 1.94/2.14 ======= end of input processing =======
% 1.94/2.14
% 1.94/2.14 =========== start of search ===========
% 1.94/2.14
% 1.94/2.14 -------- PROOF --------
% 1.94/2.14
% 1.94/2.14 -----> EMPTY CLAUSE at 0.00 sec ----> 92 [hyper,91,9,38,46] $F.
% 1.94/2.14
% 1.94/2.14 Length of proof is 3. Level of proof is 3.
% 1.94/2.14
% 1.94/2.14 ---------------- PROOF ----------------
% 1.94/2.14 % SZS status Theorem
% 1.94/2.14 % SZS output start Refutation
% See solution above
% 1.94/2.14 ------------ end of proof -------------
% 1.94/2.14
% 1.94/2.14
% 1.94/2.14 Search stopped by max_proofs option.
% 1.94/2.14
% 1.94/2.14
% 1.94/2.14 Search stopped by max_proofs option.
% 1.94/2.14
% 1.94/2.14 ============ end of search ============
% 1.94/2.14
% 1.94/2.14 -------------- statistics -------------
% 1.94/2.14 clauses given 44
% 1.94/2.14 clauses generated 167
% 1.94/2.14 clauses kept 91
% 1.94/2.14 clauses forward subsumed 113
% 1.94/2.14 clauses back subsumed 3
% 1.94/2.14 Kbytes malloced 976
% 1.94/2.14
% 1.94/2.14 ----------- times (seconds) -----------
% 1.94/2.14 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.94/2.14 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.94/2.14 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.94/2.14
% 1.94/2.14 That finishes the proof of the theorem.
% 1.94/2.14
% 1.94/2.14 Process 926 finished Wed Jul 27 03:26:03 2022
% 1.94/2.14 Otter interrupted
% 1.94/2.14 PROOF FOUND
%------------------------------------------------------------------------------