TSTP Solution File: SYN066-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN066-1 : TPTP v8.1.0. Released v1.0.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:23:28 EDT 2022
% Result : Unsatisfiable 1.88s 2.09s
% Output : Refutation 1.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 5 unt; 2 nHn; 3 RR)
% Number of literals : 13 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 16 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ big_p(f(A,B),g(A))
| big_q(h(A,B),g(A)) ),
file('SYN066-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ big_q(A,B)
| big_r(C,C) ),
file('SYN066-1.p',unknown),
[] ).
cnf(4,axiom,
~ big_r(a,A),
file('SYN066-1.p',unknown),
[] ).
cnf(6,axiom,
( big_p(A,B)
| big_q(i(A,B),A) ),
file('SYN066-1.p',unknown),
[] ).
cnf(8,plain,
( big_p(A,B)
| big_r(C,C) ),
inference(hyper,[status(thm)],[6,3]),
[iquote('hyper,6,3')] ).
cnf(9,plain,
big_p(A,B),
inference(hyper,[status(thm)],[8,4]),
[iquote('hyper,8,4')] ).
cnf(10,plain,
big_q(h(A,B),g(A)),
inference(hyper,[status(thm)],[9,2]),
[iquote('hyper,9,2')] ).
cnf(11,plain,
big_r(A,A),
inference(hyper,[status(thm)],[10,3]),
[iquote('hyper,10,3')] ).
cnf(12,plain,
$false,
inference(binary,[status(thm)],[11,4]),
[iquote('binary,11.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN066-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.32 % Computer : n006.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Wed Jul 27 11:14:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.88/2.09 ----- Otter 3.3f, August 2004 -----
% 1.88/2.09 The process was started by sandbox on n006.cluster.edu,
% 1.88/2.09 Wed Jul 27 11:14:02 2022
% 1.88/2.09 The command was "./otter". The process ID is 18222.
% 1.88/2.09
% 1.88/2.09 set(prolog_style_variables).
% 1.88/2.09 set(auto).
% 1.88/2.09 dependent: set(auto1).
% 1.88/2.09 dependent: set(process_input).
% 1.88/2.09 dependent: clear(print_kept).
% 1.88/2.09 dependent: clear(print_new_demod).
% 1.88/2.09 dependent: clear(print_back_demod).
% 1.88/2.09 dependent: clear(print_back_sub).
% 1.88/2.09 dependent: set(control_memory).
% 1.88/2.09 dependent: assign(max_mem, 12000).
% 1.88/2.09 dependent: assign(pick_given_ratio, 4).
% 1.88/2.09 dependent: assign(stats_level, 1).
% 1.88/2.09 dependent: assign(max_seconds, 10800).
% 1.88/2.09 clear(print_given).
% 1.88/2.09
% 1.88/2.09 list(usable).
% 1.88/2.09 0 [] -big_p(Y,X)|big_p(f(X,Y),g(X)).
% 1.88/2.09 0 [] big_p(f(X,Y),X).
% 1.88/2.09 0 [] -big_p(f(X,Y),g(X))|big_q(h(X,Y),g(X)).
% 1.88/2.09 0 [] big_p(X,Y)|big_q(i(X,Y),X).
% 1.88/2.09 0 [] -big_q(X,Y)|big_r(Z,Z).
% 1.88/2.09 0 [] -big_r(a,Z).
% 1.88/2.09 end_of_list.
% 1.88/2.09
% 1.88/2.09 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=2.
% 1.88/2.09
% 1.88/2.09 This is a non-Horn set without equality. The strategy will
% 1.88/2.09 be ordered hyper_res, unit deletion, and factoring, with
% 1.88/2.09 satellites in sos and with nuclei in usable.
% 1.88/2.09
% 1.88/2.09 dependent: set(hyper_res).
% 1.88/2.09 dependent: set(factor).
% 1.88/2.09 dependent: set(unit_deletion).
% 1.88/2.09
% 1.88/2.09 ------------> process usable:
% 1.88/2.09 ** KEPT (pick-wt=9): 1 [] -big_p(A,B)|big_p(f(B,A),g(B)).
% 1.88/2.09 ** KEPT (pick-wt=12): 2 [] -big_p(f(A,B),g(A))|big_q(h(A,B),g(A)).
% 1.88/2.09 ** KEPT (pick-wt=6): 3 [] -big_q(A,B)|big_r(C,C).
% 1.88/2.09 ** KEPT (pick-wt=3): 4 [] -big_r(a,A).
% 1.88/2.09
% 1.88/2.09 ------------> process sos:
% 1.88/2.09 ** KEPT (pick-wt=5): 5 [] big_p(f(A,B),A).
% 1.88/2.09 ** KEPT (pick-wt=8): 6 [] big_p(A,B)|big_q(i(A,B),A).
% 1.88/2.09
% 1.88/2.09 ======= end of input processing =======
% 1.88/2.09
% 1.88/2.09 =========== start of search ===========
% 1.88/2.09
% 1.88/2.09 -------- PROOF --------
% 1.88/2.09
% 1.88/2.09 ----> UNIT CONFLICT at 0.00 sec ----> 12 [binary,11.1,4.1] $F.
% 1.88/2.09
% 1.88/2.09 Length of proof is 4. Level of proof is 4.
% 1.88/2.09
% 1.88/2.09 ---------------- PROOF ----------------
% 1.88/2.09 % SZS status Unsatisfiable
% 1.88/2.09 % SZS output start Refutation
% See solution above
% 1.88/2.09 ------------ end of proof -------------
% 1.88/2.09
% 1.88/2.09
% 1.88/2.09 Search stopped by max_proofs option.
% 1.88/2.09
% 1.88/2.09
% 1.88/2.09 Search stopped by max_proofs option.
% 1.88/2.09
% 1.88/2.09 ============ end of search ============
% 1.88/2.09
% 1.88/2.09 -------------- statistics -------------
% 1.88/2.09 clauses given 5
% 1.88/2.09 clauses generated 5
% 1.88/2.09 clauses kept 11
% 1.88/2.09 clauses forward subsumed 0
% 1.88/2.09 clauses back subsumed 6
% 1.88/2.09 Kbytes malloced 976
% 1.88/2.09
% 1.88/2.09 ----------- times (seconds) -----------
% 1.88/2.09 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.88/2.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.88/2.09 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.88/2.09
% 1.88/2.09 That finishes the proof of the theorem.
% 1.88/2.09
% 1.88/2.09 Process 18222 finished Wed Jul 27 11:14:03 2022
% 1.88/2.09 Otter interrupted
% 1.88/2.09 PROOF FOUND
%------------------------------------------------------------------------------