%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN009-4 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n005.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:23:18 EDT 2022
% Result : Unsatisfiable 1.66s 1.87s
% Output : Refutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 16 ( 5 unt; 8 nHn; 16 RR)
% Number of literals : 43 ( 0 equ; 19 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ p(A,B,C)
| ~ m(A,B,C) ),
file('SYN009-4.p',unknown),
[] ).
cnf(2,axiom,
( ~ q(A,B,C)
| ~ m(A,B,C) ),
file('SYN009-4.p',unknown),
[] ).
cnf(3,axiom,
( ~ r(A,B,C)
| ~ m(A,B,C) ),
file('SYN009-4.p',unknown),
[] ).
cnf(4,axiom,
~ n(c,c,c),
file('SYN009-4.p',unknown),
[] ).
cnf(5,axiom,
( ~ s(A)
| ~ s(B)
| ~ s(C)
| p(A,B,C)
| q(A,B,C)
| r(A,B,C) ),
file('SYN009-4.p',unknown),
[] ).
cnf(6,axiom,
( ~ s(A)
| ~ s(B)
| ~ s(C)
| m(A,B,C)
| n(A,B,C) ),
file('SYN009-4.p',unknown),
[] ).
cnf(7,plain,
( ~ s(A)
| ~ s(B)
| p(A,A,B)
| q(A,A,B)
| r(A,A,B) ),
inference(factor,[status(thm)],[5]),
[iquote('factor,5.1.2')] ).
cnf(10,plain,
( ~ s(A)
| ~ s(B)
| m(A,A,B)
| n(A,A,B) ),
inference(factor,[status(thm)],[6]),
[iquote('factor,6.1.2')] ).
cnf(13,plain,
( ~ s(A)
| p(A,A,A)
| q(A,A,A)
| r(A,A,A) ),
inference(factor,[status(thm)],[7]),
[iquote('factor,7.1.2')] ).
cnf(14,plain,
( ~ s(A)
| m(A,A,A)
| n(A,A,A) ),
inference(factor,[status(thm)],[10]),
[iquote('factor,10.1.2')] ).
cnf(17,axiom,
s(c),
file('SYN009-4.p',unknown),
[] ).
cnf(34,plain,
m(c,c,c),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[17,14]),4]),
[iquote('hyper,17,14,unit_del,4')] ).
cnf(35,plain,
( p(c,c,c)
| q(c,c,c)
| r(c,c,c) ),
inference(hyper,[status(thm)],[17,13]),
[iquote('hyper,17,13')] ).
cnf(72,plain,
( p(c,c,c)
| q(c,c,c) ),
inference(hyper,[status(thm)],[35,3,34]),
[iquote('hyper,35,3,34')] ).
cnf(73,plain,
p(c,c,c),
inference(hyper,[status(thm)],[72,2,34]),
[iquote('hyper,72,2,34')] ).
cnf(74,plain,
$false,
inference(hyper,[status(thm)],[73,1,34]),
[iquote('hyper,73,1,34')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN009-4 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n005.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 11:26:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.66/1.87 ----- Otter 3.3f, August 2004 -----
% 1.66/1.87 The process was started by sandbox2 on n005.cluster.edu,
% 1.66/1.87 Wed Jul 27 11:26:20 2022
% 1.66/1.87 The command was "./otter". The process ID is 28494.
% 1.66/1.87
% 1.66/1.87 set(prolog_style_variables).
% 1.66/1.87 set(auto).
% 1.66/1.87 dependent: set(auto1).
% 1.66/1.87 dependent: set(process_input).
% 1.66/1.87 dependent: clear(print_kept).
% 1.66/1.87 dependent: clear(print_new_demod).
% 1.66/1.87 dependent: clear(print_back_demod).
% 1.66/1.87 dependent: clear(print_back_sub).
% 1.66/1.87 dependent: set(control_memory).
% 1.66/1.87 dependent: assign(max_mem, 12000).
% 1.66/1.87 dependent: assign(pick_given_ratio, 4).
% 1.66/1.87 dependent: assign(stats_level, 1).
% 1.66/1.87 dependent: assign(max_seconds, 10800).
% 1.66/1.87 clear(print_given).
% 1.66/1.87
% 1.66/1.87 list(usable).
% 1.66/1.87 0 [] -p(X,Y,Z)| -m(X,Y,Z).
% 1.66/1.87 0 [] -q(X,Y,Z)| -m(X,Y,Z).
% 1.66/1.87 0 [] -r(X,Y,Z)| -m(X,Y,Z).
% 1.66/1.87 0 [] s(a).
% 1.66/1.87 0 [] s(b).
% 1.66/1.87 0 [] s(c).
% 1.66/1.87 0 [] -n(c,c,c).
% 1.66/1.87 0 [] -s(X)| -s(Y)| -s(Z)|p(X,Y,Z)|q(X,Y,Z)|r(X,Y,Z).
% 1.66/1.87 0 [] -s(X)| -s(Y)| -s(Z)|m(X,Y,Z)|n(X,Y,Z).
% 1.66/1.87 end_of_list.
% 1.66/1.87
% 1.66/1.87 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.66/1.87
% 1.66/1.87 This is a non-Horn set without equality. The strategy will
% 1.66/1.87 be ordered hyper_res, unit deletion, and factoring, with
% 1.66/1.87 satellites in sos and with nuclei in usable.
% 1.66/1.87
% 1.66/1.87 dependent: set(hyper_res).
% 1.66/1.87 dependent: set(factor).
% 1.66/1.87 dependent: set(unit_deletion).
% 1.66/1.87
% 1.66/1.87 ------------> process usable:
% 1.66/1.87 ** KEPT (pick-wt=8): 1 [] -p(A,B,C)| -m(A,B,C).
% 1.66/1.87 ** KEPT (pick-wt=8): 2 [] -q(A,B,C)| -m(A,B,C).
% 1.66/1.87 ** KEPT (pick-wt=8): 3 [] -r(A,B,C)| -m(A,B,C).
% 1.66/1.87 ** KEPT (pick-wt=4): 4 [] -n(c,c,c).
% 1.66/1.87 ** KEPT (pick-wt=18): 5 [] -s(A)| -s(B)| -s(C)|p(A,B,C)|q(A,B,C)|r(A,B,C).
% 1.66/1.87 ** KEPT (pick-wt=14): 6 [] -s(A)| -s(B)| -s(C)|m(A,B,C)|n(A,B,C).
% 1.66/1.87
% 1.66/1.87 ------------> process sos:
% 1.66/1.87 ** KEPT (pick-wt=2): 15 [] s(a).
% 1.66/1.87 ** KEPT (pick-wt=2): 16 [] s(b).
% 1.66/1.87 ** KEPT (pick-wt=2): 17 [] s(c).
% 1.66/1.87
% 1.66/1.87 ======= end of input processing =======
% 1.66/1.87
% 1.66/1.87 =========== start of search ===========
% 1.66/1.87
% 1.66/1.87 -------- PROOF --------
% 1.66/1.87
% 1.66/1.87 -----> EMPTY CLAUSE at 0.00 sec ----> 74 [hyper,73,1,34] $F.
% 1.66/1.87
% 1.66/1.87 Length of proof is 8. Level of proof is 5.
% 1.66/1.87
% 1.66/1.87 ---------------- PROOF ----------------
% 1.66/1.87 % SZS status Unsatisfiable
% 1.66/1.87 % SZS output start Refutation
% See solution above
% 1.66/1.87 ------------ end of proof -------------
% 1.66/1.87
% 1.66/1.87
% 1.66/1.87 Search stopped by max_proofs option.
% 1.66/1.87
% 1.66/1.87
% 1.66/1.87 Search stopped by max_proofs option.
% 1.66/1.87
% 1.66/1.87 ============ end of search ============
% 1.66/1.87
% 1.66/1.87 -------------- statistics -------------
% 1.66/1.87 clauses given 42
% 1.66/1.87 clauses generated 177
% 1.66/1.87 clauses kept 73
% 1.66/1.87 clauses forward subsumed 112
% 1.66/1.87 clauses back subsumed 2
% 1.66/1.87 Kbytes malloced 976
% 1.66/1.87
% 1.66/1.87 ----------- times (seconds) -----------
% 1.66/1.87 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.87 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.87 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.66/1.87
% 1.66/1.87 That finishes the proof of the theorem.
% 1.66/1.87
% 1.66/1.87 Process 28494 finished Wed Jul 27 11:26:22 2022
% 1.66/1.87 Otter interrupted
% 1.66/1.87 PROOF FOUND
%------------------------------------------------------------------------------