TSTP Solution File: SYN074-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN074-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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:30 EDT 2022
% Result : Unsatisfiable 2.06s 2.25s
% Output : Refutation 2.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 15 ( 5 unt; 6 nHn; 9 RR)
% Number of literals : 29 ( 19 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 17 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ big_f(A,B)
| A = a ),
file('SYN074-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ big_f(A,B)
| B = b ),
file('SYN074-1.p',unknown),
[] ).
cnf(3,axiom,
( A != a
| B != b
| big_f(A,B) ),
file('SYN074-1.p',unknown),
[] ).
cnf(8,axiom,
( A != g(B)
| big_f(f(B),A)
| f(B) = B ),
file('SYN074-1.p',unknown),
[] ).
cnf(10,axiom,
( f(A) != A
| big_f(f(A),h(A,B))
| h(A,B) = B ),
file('SYN074-1.p',unknown),
[] ).
cnf(11,axiom,
( f(A) != A
| h(A,B) != B
| ~ big_f(f(A),h(A,B)) ),
file('SYN074-1.p',unknown),
[] ).
cnf(14,axiom,
A = A,
file('SYN074-1.p',unknown),
[] ).
cnf(15,plain,
( big_f(f(A),g(A))
| f(A) = A ),
inference(hyper,[status(thm)],[14,8]),
[iquote('hyper,14,8')] ).
cnf(17,plain,
big_f(a,b),
inference(hyper,[status(thm)],[14,3,14]),
[iquote('hyper,14,3,14')] ).
cnf(43,plain,
( f(A) = A
| f(A) = a ),
inference(hyper,[status(thm)],[15,1]),
[iquote('hyper,15,1')] ).
cnf(45,plain,
f(a) = a,
inference(factor,[status(thm)],[43]),
[iquote('factor,43.1.2')] ).
cnf(111,plain,
( big_f(a,h(a,A))
| h(a,A) = A ),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[45,10]),45]),
[iquote('hyper,44,10,demod,45')] ).
cnf(718,plain,
( h(a,A) = A
| h(a,A) = b ),
inference(hyper,[status(thm)],[111,2]),
[iquote('hyper,111,2')] ).
cnf(720,plain,
h(a,b) = b,
inference(factor,[status(thm)],[718]),
[iquote('factor,718.1.2')] ).
cnf(752,plain,
$false,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[720,11]),45,720,45]),14,14,17]),
[iquote('para_from,719.1.1,11.3.2,demod,45,720,45,unit_del,14,14,17')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN074-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n023.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:44:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.06/2.25 ----- Otter 3.3f, August 2004 -----
% 2.06/2.25 The process was started by sandbox2 on n023.cluster.edu,
% 2.06/2.25 Wed Jul 27 11:44:33 2022
% 2.06/2.25 The command was "./otter". The process ID is 24130.
% 2.06/2.25
% 2.06/2.25 set(prolog_style_variables).
% 2.06/2.25 set(auto).
% 2.06/2.25 dependent: set(auto1).
% 2.06/2.25 dependent: set(process_input).
% 2.06/2.25 dependent: clear(print_kept).
% 2.06/2.25 dependent: clear(print_new_demod).
% 2.06/2.25 dependent: clear(print_back_demod).
% 2.06/2.25 dependent: clear(print_back_sub).
% 2.06/2.25 dependent: set(control_memory).
% 2.06/2.25 dependent: assign(max_mem, 12000).
% 2.06/2.25 dependent: assign(pick_given_ratio, 4).
% 2.06/2.25 dependent: assign(stats_level, 1).
% 2.06/2.25 dependent: assign(max_seconds, 10800).
% 2.06/2.25 clear(print_given).
% 2.06/2.25
% 2.06/2.25 list(usable).
% 2.06/2.25 0 [] A=A.
% 2.06/2.25 0 [] -big_f(X,Y)|X=a.
% 2.06/2.25 0 [] -big_f(X,Y)|Y=b.
% 2.06/2.25 0 [] X!=a|Y!=b|big_f(X,Y).
% 2.06/2.25 0 [] -big_f(f(X),Y)|Y=g(X)|f(X)=X.
% 2.06/2.25 0 [] -big_f(f(X),Y)|Y=g(X)|big_f(f(X),h(X,Z))|h(X,Z)=Z.
% 2.06/2.25 0 [] -big_f(f(X),Y)|Y=g(X)|h(X,Z)!=Z| -big_f(f(X),h(X,Z)).
% 2.06/2.25 0 [] Y!=g(X)|big_f(f(X),Y)|big_f(f(X),h(X,Z))|h(X,Z)=Z.
% 2.06/2.25 0 [] Y!=g(X)|big_f(f(X),Y)|f(X)=X.
% 2.06/2.25 0 [] Y!=g(X)|big_f(f(X),Y)|h(X,Z)!=Z| -big_f(f(X),h(X,Z)).
% 2.06/2.25 0 [] f(X)!=X|big_f(f(X),h(X,Z))|h(X,Z)=Z.
% 2.06/2.25 0 [] f(X)!=X|h(X,Z)!=Z| -big_f(f(X),h(X,Z)).
% 2.06/2.25 end_of_list.
% 2.06/2.25
% 2.06/2.25 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 2.06/2.25
% 2.06/2.25 This ia a non-Horn set with equality. The strategy will be
% 2.06/2.25 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.06/2.25 deletion, with positive clauses in sos and nonpositive
% 2.06/2.25 clauses in usable.
% 2.06/2.25
% 2.06/2.25 dependent: set(knuth_bendix).
% 2.06/2.25 dependent: set(anl_eq).
% 2.06/2.25 dependent: set(para_from).
% 2.06/2.25 dependent: set(para_into).
% 2.06/2.25 dependent: clear(para_from_right).
% 2.06/2.25 dependent: clear(para_into_right).
% 2.06/2.25 dependent: set(para_from_vars).
% 2.06/2.25 dependent: set(eq_units_both_ways).
% 2.06/2.25 dependent: set(dynamic_demod_all).
% 2.06/2.25 dependent: set(dynamic_demod).
% 2.06/2.25 dependent: set(order_eq).
% 2.06/2.25 dependent: set(back_demod).
% 2.06/2.25 dependent: set(lrpo).
% 2.06/2.25 dependent: set(hyper_res).
% 2.06/2.25 dependent: set(unit_deletion).
% 2.06/2.25 dependent: set(factor).
% 2.06/2.25
% 2.06/2.25 ------------> process usable:
% 2.06/2.25 ** KEPT (pick-wt=6): 1 [] -big_f(A,B)|A=a.
% 2.06/2.25 ** KEPT (pick-wt=6): 2 [] -big_f(A,B)|B=b.
% 2.06/2.25 ** KEPT (pick-wt=9): 3 [] A!=a|B!=b|big_f(A,B).
% 2.06/2.25 ** KEPT (pick-wt=12): 4 [] -big_f(f(A),B)|B=g(A)|f(A)=A.
% 2.06/2.25 ** KEPT (pick-wt=19): 5 [] -big_f(f(A),B)|B=g(A)|big_f(f(A),h(A,C))|h(A,C)=C.
% 2.06/2.25 ** KEPT (pick-wt=19): 6 [] -big_f(f(A),B)|B=g(A)|h(A,C)!=C| -big_f(f(A),h(A,C)).
% 2.06/2.25 ** KEPT (pick-wt=19): 7 [] A!=g(B)|big_f(f(B),A)|big_f(f(B),h(B,C))|h(B,C)=C.
% 2.06/2.25 ** KEPT (pick-wt=12): 8 [] A!=g(B)|big_f(f(B),A)|f(B)=B.
% 2.06/2.25 ** KEPT (pick-wt=19): 9 [] A!=g(B)|big_f(f(B),A)|h(B,C)!=C| -big_f(f(B),h(B,C)).
% 2.06/2.25 ** KEPT (pick-wt=15): 10 [] f(A)!=A|big_f(f(A),h(A,B))|h(A,B)=B.
% 2.06/2.25 ** KEPT (pick-wt=15): 11 [] f(A)!=A|h(A,B)!=B| -big_f(f(A),h(A,B)).
% 2.06/2.25
% 2.06/2.25 ------------> process sos:
% 2.06/2.25 ** KEPT (pick-wt=3): 14 [] A=A.
% 2.06/2.25 Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] A=A.
% 2.06/2.25
% 2.06/2.25 ======= end of input processing =======
% 2.06/2.25
% 2.06/2.25 =========== start of search ===========
% 2.06/2.25
% 2.06/2.25 -------- PROOF --------
% 2.06/2.25
% 2.06/2.25 -----> EMPTY CLAUSE at 0.13 sec ----> 752 [para_from,719.1.1,11.3.2,demod,45,720,45,unit_del,14,14,17] $F.
% 2.06/2.25
% 2.06/2.25 Length of proof is 7. Level of proof is 6.
% 2.06/2.25
% 2.06/2.25 ---------------- PROOF ----------------
% 2.06/2.25 % SZS status Unsatisfiable
% 2.06/2.25 % SZS output start Refutation
% See solution above
% 2.06/2.25 ------------ end of proof -------------
% 2.06/2.25
% 2.06/2.25
% 2.06/2.25 Search stopped by max_proofs option.
% 2.06/2.25
% 2.06/2.25
% 2.06/2.25 Search stopped by max_proofs option.
% 2.06/2.25
% 2.06/2.25 ============ end of search ============
% 2.06/2.25
% 2.06/2.25 -------------- statistics -------------
% 2.06/2.25 clauses given 30
% 2.06/2.25 clauses generated 1998
% 2.06/2.25 clauses kept 748
% 2.06/2.25 clauses forward subsumed 1201
% 2.06/2.25 clauses back subsumed 158
% 2.06/2.25 Kbytes malloced 1953
% 2.06/2.25
% 2.06/2.25 ----------- times (seconds) -----------
% 2.06/2.25 user CPU time 0.13 (0 hr, 0 min, 0 sec)
% 2.06/2.25 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.06/2.25 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.06/2.25
% 2.06/2.25 That finishes the proof of the theorem.
% 2.06/2.25
% 2.06/2.25 Process 24130 finished Wed Jul 27 11:44:35 2022
% 2.06/2.25 Otter interrupted
% 2.06/2.25 PROOF FOUND
%------------------------------------------------------------------------------