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