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