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