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