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