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