%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN310-1 : TPTP v8.1.0. Released v1.2.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:24:12 EDT 2022
% Result : Unsatisfiable 1.92s 2.11s
% Output : Refutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 15 unt; 0 nHn; 19 RR)
% Number of literals : 23 ( 0 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ p(A,B,C)
| p(C,B,A) ),
file('SYN310-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ p(A,B,C)
| p(B,A,C) ),
file('SYN310-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ p(A,B,g(C))
| p(A,B,C) ),
file('SYN310-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ p(f(A),B,C)
| p(A,B,C) ),
file('SYN310-1.p',unknown),
[] ).
cnf(5,axiom,
~ p(a,b,c),
file('SYN310-1.p',unknown),
[] ).
cnf(6,axiom,
p(f(g(a)),f(g(b)),f(g(c))),
file('SYN310-1.p',unknown),
[] ).
cnf(7,plain,
p(g(a),f(g(b)),f(g(c))),
inference(hyper,[status(thm)],[6,4]),
[iquote('hyper,6,4')] ).
cnf(10,plain,
p(f(g(b)),g(a),f(g(c))),
inference(hyper,[status(thm)],[7,2]),
[iquote('hyper,7,2')] ).
cnf(12,plain,
p(g(b),g(a),f(g(c))),
inference(hyper,[status(thm)],[10,4]),
[iquote('hyper,10,4')] ).
cnf(15,plain,
p(f(g(c)),g(a),g(b)),
inference(hyper,[status(thm)],[12,1]),
[iquote('hyper,12,1')] ).
cnf(19,plain,
p(g(c),g(a),g(b)),
inference(hyper,[status(thm)],[15,4]),
[iquote('hyper,15,4')] ).
cnf(22,plain,
p(g(c),g(a),b),
inference(hyper,[status(thm)],[19,3]),
[iquote('hyper,19,3')] ).
cnf(26,plain,
p(b,g(a),g(c)),
inference(hyper,[status(thm)],[22,1]),
[iquote('hyper,22,1')] ).
cnf(30,plain,
p(b,g(a),c),
inference(hyper,[status(thm)],[26,3]),
[iquote('hyper,26,3')] ).
cnf(32,plain,
p(g(a),b,c),
inference(hyper,[status(thm)],[30,2]),
[iquote('hyper,30,2')] ).
cnf(34,plain,
p(c,b,g(a)),
inference(hyper,[status(thm)],[32,1]),
[iquote('hyper,32,1')] ).
cnf(39,plain,
p(c,b,a),
inference(hyper,[status(thm)],[34,3]),
[iquote('hyper,34,3')] ).
cnf(42,plain,
p(a,b,c),
inference(hyper,[status(thm)],[39,1]),
[iquote('hyper,39,1')] ).
cnf(43,plain,
$false,
inference(binary,[status(thm)],[42,5]),
[iquote('binary,42.1,5.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN310-1 : TPTP v8.1.0. Released v1.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n011.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 11:16:25 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.92/2.11 ----- Otter 3.3f, August 2004 -----
% 1.92/2.11 The process was started by sandbox on n011.cluster.edu,
% 1.92/2.11 Wed Jul 27 11:16:25 2022
% 1.92/2.11 The command was "./otter". The process ID is 3266.
% 1.92/2.11
% 1.92/2.11 set(prolog_style_variables).
% 1.92/2.11 set(auto).
% 1.92/2.11 dependent: set(auto1).
% 1.92/2.11 dependent: set(process_input).
% 1.92/2.11 dependent: clear(print_kept).
% 1.92/2.11 dependent: clear(print_new_demod).
% 1.92/2.11 dependent: clear(print_back_demod).
% 1.92/2.11 dependent: clear(print_back_sub).
% 1.92/2.11 dependent: set(control_memory).
% 1.92/2.11 dependent: assign(max_mem, 12000).
% 1.92/2.11 dependent: assign(pick_given_ratio, 4).
% 1.92/2.11 dependent: assign(stats_level, 1).
% 1.92/2.11 dependent: assign(max_seconds, 10800).
% 1.92/2.11 clear(print_given).
% 1.92/2.11
% 1.92/2.11 list(usable).
% 1.92/2.11 0 [] -p(X2,X1,X)|p(X,X1,X2).
% 1.92/2.11 0 [] -p(X1,X,X2)|p(X,X1,X2).
% 1.92/2.11 0 [] -p(X,X1,g(X2))|p(X,X1,X2).
% 1.92/2.11 0 [] -p(f(X),X1,X2)|p(X,X1,X2).
% 1.92/2.11 0 [] -p(a,b,c).
% 1.92/2.11 0 [] p(f(g(a)),f(g(b)),f(g(c))).
% 1.92/2.11 end_of_list.
% 1.92/2.11
% 1.92/2.11 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=2.
% 1.92/2.11
% 1.92/2.11 This is a Horn set without equality. The strategy will
% 1.92/2.11 be hyperresolution, with satellites in sos and nuclei
% 1.92/2.11 in usable.
% 1.92/2.11
% 1.92/2.11 dependent: set(hyper_res).
% 1.92/2.11 dependent: clear(order_hyper).
% 1.92/2.11
% 1.92/2.11 ------------> process usable:
% 1.92/2.11 ** KEPT (pick-wt=8): 1 [] -p(A,B,C)|p(C,B,A).
% 1.92/2.11 ** KEPT (pick-wt=8): 2 [] -p(A,B,C)|p(B,A,C).
% 1.92/2.11 ** KEPT (pick-wt=9): 3 [] -p(A,B,g(C))|p(A,B,C).
% 1.92/2.11 ** KEPT (pick-wt=9): 4 [] -p(f(A),B,C)|p(A,B,C).
% 1.92/2.11 ** KEPT (pick-wt=4): 5 [] -p(a,b,c).
% 1.92/2.11
% 1.92/2.11 ------------> process sos:
% 1.92/2.11 ** KEPT (pick-wt=10): 6 [] p(f(g(a)),f(g(b)),f(g(c))).
% 1.92/2.11
% 1.92/2.11 ======= end of input processing =======
% 1.92/2.11
% 1.92/2.11 =========== start of search ===========
% 1.92/2.11
% 1.92/2.11 -------- PROOF --------
% 1.92/2.11
% 1.92/2.11 ----> UNIT CONFLICT at 0.00 sec ----> 43 [binary,42.1,5.1] $F.
% 1.92/2.11
% 1.92/2.11 Length of proof is 12. Level of proof is 12.
% 1.92/2.11
% 1.92/2.11 ---------------- PROOF ----------------
% 1.92/2.11 % SZS status Unsatisfiable
% 1.92/2.11 % SZS output start Refutation
% See solution above
% 1.92/2.11 ------------ end of proof -------------
% 1.92/2.11
% 1.92/2.11
% 1.92/2.11 Search stopped by max_proofs option.
% 1.92/2.11
% 1.92/2.11
% 1.92/2.11 Search stopped by max_proofs option.
% 1.92/2.11
% 1.92/2.11 ============ end of search ============
% 1.92/2.11
% 1.92/2.11 -------------- statistics -------------
% 1.92/2.11 clauses given 18
% 1.92/2.11 clauses generated 47
% 1.92/2.11 clauses kept 42
% 1.92/2.11 clauses forward subsumed 11
% 1.92/2.11 clauses back subsumed 0
% 1.92/2.11 Kbytes malloced 976
% 1.92/2.11
% 1.92/2.11 ----------- times (seconds) -----------
% 1.92/2.11 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.11 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.92/2.11
% 1.92/2.11 That finishes the proof of the theorem.
% 1.92/2.11
% 1.92/2.11 Process 3266 finished Wed Jul 27 11:16:27 2022
% 1.92/2.11 Otter interrupted
% 1.92/2.11 PROOF FOUND
%------------------------------------------------------------------------------