TSTP Solution File: LDA007-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LDA007-1 : TPTP v8.1.0. Bugfixed v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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:05:48 EDT 2022
% Result : Unsatisfiable 1.72s 1.93s
% Output : Refutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 15 RR)
% Number of literals : 19 ( 18 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
f(t,tsk) != f(tt_ts,tk),
file('LDA007-1.p',unknown),
[] ).
cnf(6,plain,
f(tt_ts,tk) != f(t,tsk),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[5])]),
[iquote('copy,5,flip.1')] ).
cnf(8,axiom,
f(A,f(B,C)) = f(f(A,B),f(A,C)),
file('LDA007-1.p',unknown),
[] ).
cnf(9,plain,
f(f(A,B),f(A,C)) = f(A,f(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[8])]),
[iquote('copy,8,flip.1')] ).
cnf(18,axiom,
tt = f(t,t),
file('LDA007-1.p',unknown),
[] ).
cnf(19,plain,
f(t,t) = tt,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[18])]),
[iquote('copy,18,flip.1')] ).
cnf(24,axiom,
ts = f(t,s),
file('LDA007-1.p',unknown),
[] ).
cnf(26,plain,
f(t,s) = ts,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[24])]),
[iquote('copy,24,flip.1')] ).
cnf(27,axiom,
tt_ts = f(tt,ts),
file('LDA007-1.p',unknown),
[] ).
cnf(29,plain,
f(tt,ts) = tt_ts,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[27])]),
[iquote('copy,27,flip.1')] ).
cnf(36,axiom,
tk = f(t,k),
file('LDA007-1.p',unknown),
[] ).
cnf(37,plain,
f(t,k) = tk,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[36])]),
[iquote('copy,36,flip.1')] ).
cnf(42,axiom,
tsk = f(ts,k),
file('LDA007-1.p',unknown),
[] ).
cnf(44,plain,
f(ts,k) = tsk,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[42])]),
[iquote('copy,42,flip.1')] ).
cnf(53,plain,
f(tt,f(t,A)) = f(t,f(t,A)),
inference(para_into,[status(thm),theory(equality)],[9,19]),
[iquote('para_into,9.1.1.1,19.1.1')] ).
cnf(73,plain,
f(f(t,A),tk) = f(t,f(A,k)),
inference(para_from,[status(thm),theory(equality)],[37,9]),
[iquote('para_from,37.1.1,9.1.1.2')] ).
cnf(431,plain,
f(t,ts) = tt_ts,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[53,26]),29,26])]),
[iquote('para_into,53.1.1.2,25.1.1,demod,29,26,flip.1')] ).
cnf(1640,plain,
f(tt_ts,tk) = f(t,tsk),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[73,431]),44]),
[iquote('para_into,73.1.1.1,431.1.1,demod,44')] ).
cnf(1642,plain,
$false,
inference(binary,[status(thm)],[1640,6]),
[iquote('binary,1640.1,6.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LDA007-1 : TPTP v8.1.0. Bugfixed v2.6.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 02:03:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.59/1.81 ----- Otter 3.3f, August 2004 -----
% 1.59/1.81 The process was started by sandbox2 on n021.cluster.edu,
% 1.59/1.81 Wed Jul 27 02:03:38 2022
% 1.59/1.81 The command was "./otter". The process ID is 22551.
% 1.59/1.81
% 1.59/1.81 set(prolog_style_variables).
% 1.59/1.81 set(auto).
% 1.59/1.81 dependent: set(auto1).
% 1.59/1.81 dependent: set(process_input).
% 1.59/1.81 dependent: clear(print_kept).
% 1.59/1.81 dependent: clear(print_new_demod).
% 1.59/1.81 dependent: clear(print_back_demod).
% 1.59/1.81 dependent: clear(print_back_sub).
% 1.59/1.81 dependent: set(control_memory).
% 1.59/1.81 dependent: assign(max_mem, 12000).
% 1.59/1.81 dependent: assign(pick_given_ratio, 4).
% 1.59/1.81 dependent: assign(stats_level, 1).
% 1.59/1.81 dependent: assign(max_seconds, 10800).
% 1.59/1.81 clear(print_given).
% 1.59/1.81
% 1.59/1.81 list(usable).
% 1.59/1.81 0 [] A=A.
% 1.59/1.81 0 [] f(X,f(Y,Z))=f(f(X,Y),f(X,Z)).
% 1.59/1.81 0 [] a(X,a(Y,Z))=a(f(X,Y),a(X,Z)).
% 1.59/1.81 0 [] critical_point(f(U,V))=a(U,critical_point(V)).
% 1.59/1.81 0 [] -less(X,X).
% 1.59/1.81 0 [] less(X,Y)|less(Y,X)|X=Y.
% 1.59/1.81 0 [] -less(X,Y)| -less(Y,Z)|less(X,Z).
% 1.59/1.81 0 [] -less(X,Y)|less(a(U,X),a(U,Y)).
% 1.59/1.81 0 [] -less(X,critical_point(U))|a(U,X)=X.
% 1.59/1.81 0 [] less(X,critical_point(U))|less(X,a(U,X)).
% 1.59/1.81 0 [] tt=f(t,t).
% 1.59/1.81 0 [] st=f(s,t).
% 1.59/1.81 0 [] ts=f(t,s).
% 1.59/1.81 0 [] tt_ts=f(tt,ts).
% 1.59/1.81 0 [] k=critical_point(t).
% 1.59/1.81 0 [] sk=f(s,k).
% 1.59/1.81 0 [] tk=f(t,k).
% 1.59/1.81 0 [] stk=f(st,k).
% 1.59/1.81 0 [] tsk=f(ts,k).
% 1.59/1.81 0 [] ttk=f(tt,k).
% 1.59/1.81 0 [] f(t,tsk)!=f(tt_ts,tk).
% 1.59/1.81 end_of_list.
% 1.59/1.81
% 1.59/1.81 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.59/1.81
% 1.59/1.81 This ia a non-Horn set with equality. The strategy will be
% 1.59/1.81 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.59/1.81 deletion, with positive clauses in sos and nonpositive
% 1.59/1.81 clauses in usable.
% 1.59/1.81
% 1.59/1.81 dependent: set(knuth_bendix).
% 1.59/1.81 dependent: set(anl_eq).
% 1.59/1.81 dependent: set(para_from).
% 1.59/1.81 dependent: set(para_into).
% 1.59/1.81 dependent: clear(para_from_right).
% 1.59/1.81 dependent: clear(para_into_right).
% 1.59/1.81 dependent: set(para_from_vars).
% 1.59/1.81 dependent: set(eq_units_both_ways).
% 1.59/1.81 dependent: set(dynamic_demod_all).
% 1.59/1.81 dependent: set(dynamic_demod).
% 1.59/1.81 dependent: set(order_eq).
% 1.59/1.81 dependent: set(back_demod).
% 1.59/1.81 dependent: set(lrpo).
% 1.59/1.81 dependent: set(hyper_res).
% 1.59/1.81 dependent: set(unit_deletion).
% 1.59/1.81 dependent: set(factor).
% 1.59/1.81
% 1.59/1.81 ------------> process usable:
% 1.59/1.81 ** KEPT (pick-wt=3): 1 [] -less(A,A).
% 1.59/1.81 ** KEPT (pick-wt=9): 2 [] -less(A,B)| -less(B,C)|less(A,C).
% 1.59/1.81 ** KEPT (pick-wt=10): 3 [] -less(A,B)|less(a(C,A),a(C,B)).
% 1.59/1.81 ** KEPT (pick-wt=9): 4 [] -less(A,critical_point(B))|a(B,A)=A.
% 1.59/1.81 ** KEPT (pick-wt=7): 6 [copy,5,flip.1] f(tt_ts,tk)!=f(t,tsk).
% 1.59/1.81
% 1.59/1.81 ------------> process sos:
% 1.59/1.81 ** KEPT (pick-wt=3): 7 [] A=A.
% 1.59/1.81 ** KEPT (pick-wt=13): 9 [copy,8,flip.1] f(f(A,B),f(A,C))=f(A,f(B,C)).
% 1.59/1.81 ---> New Demodulator: 10 [new_demod,9] f(f(A,B),f(A,C))=f(A,f(B,C)).
% 1.59/1.81 ** KEPT (pick-wt=13): 12 [copy,11,flip.1] a(f(A,B),a(A,C))=a(A,a(B,C)).
% 1.59/1.81 ---> New Demodulator: 13 [new_demod,12] a(f(A,B),a(A,C))=a(A,a(B,C)).
% 1.59/1.81 ** KEPT (pick-wt=9): 14 [] critical_point(f(A,B))=a(A,critical_point(B)).
% 1.59/1.81 ---> New Demodulator: 15 [new_demod,14] critical_point(f(A,B))=a(A,critical_point(B)).
% 1.59/1.81 ** KEPT (pick-wt=9): 16 [] less(A,B)|less(B,A)|A=B.
% 1.59/1.81 ** KEPT (pick-wt=9): 17 [] less(A,critical_point(B))|less(A,a(B,A)).
% 1.59/1.81 ** KEPT (pick-wt=5): 19 [copy,18,flip.1] f(t,t)=tt.
% 1.59/1.81 ---> New Demodulator: 20 [new_demod,19] f(t,t)=tt.
% 1.59/1.81 ** KEPT (pick-wt=5): 22 [copy,21,flip.1] f(s,t)=st.
% 1.59/1.81 ---> New Demodulator: 23 [new_demod,22] f(s,t)=st.
% 1.59/1.81 ** KEPT (pick-wt=5): 25 [copy,24,flip.1] f(t,s)=ts.
% 1.59/1.81 ---> New Demodulator: 26 [new_demod,25] f(t,s)=ts.
% 1.59/1.81 ** KEPT (pick-wt=5): 28 [copy,27,flip.1] f(tt,ts)=tt_ts.
% 1.59/1.81 ---> New Demodulator: 29 [new_demod,28] f(tt,ts)=tt_ts.
% 1.59/1.81 ** KEPT (pick-wt=4): 31 [copy,30,flip.1] critical_point(t)=k.
% 1.59/1.81 ---> New Demodulator: 32 [new_demod,31] critical_point(t)=k.
% 1.59/1.81 ** KEPT (pick-wt=5): 34 [copy,33,flip.1] f(s,k)=sk.
% 1.59/1.81 ---> New Demodulator: 35 [new_demod,34] f(s,k)=sk.
% 1.59/1.81 ** KEPT (pick-wt=5): 37 [copy,36,flip.1] f(t,k)=tk.
% 1.59/1.81 ---> New Demodulator: 38 [new_demod,37] f(t,k)=tk.
% 1.59/1.81 ** KEPT (pick-wt=5): 40 [copy,39,flip.1] f(st,k)=stk.
% 1.59/1.81 ---> New Demodulator: 41 [new_demod,40] f(st,k)=stk.
% 1.59/1.81 ** KEPT (pick-wt=5): 43 [copy,42,flip.1] f(ts,k)=tsk.
% 1.59/1.81 ---> New Demodulator: 44 [new_demod,43] f(ts,k)=tsk.
% 1.59/1.81 ** KEPT (pick-wt=5): 46 [copy,45,flip.1] f(tt,k)=ttk.
% 1.59/1.81 ---> New Demodulator: 47 [new_demod,46] f(tt,k)=ttk.
% 1.59/1.81 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] A=A.
% 1.59/1.81 >>>> Starting back demodulation with 10.
% 1.72/1.93 >>>> Starting back demodulation with 13.
% 1.72/1.93 >>>> Starting back demodulation with 15.
% 1.72/1.93 >>>> Starting back demodulation with 20.
% 1.72/1.93 >>>> Starting back demodulation with 23.
% 1.72/1.93 >>>> Starting back demodulation with 26.
% 1.72/1.93 >>>> Starting back demodulation with 29.
% 1.72/1.93 >>>> Starting back demodulation with 32.
% 1.72/1.93 >>>> Starting back demodulation with 35.
% 1.72/1.93 >>>> Starting back demodulation with 38.
% 1.72/1.93 >>>> Starting back demodulation with 41.
% 1.72/1.93 >>>> Starting back demodulation with 44.
% 1.72/1.93 >>>> Starting back demodulation with 47.
% 1.72/1.93
% 1.72/1.93 ======= end of input processing =======
% 1.72/1.93
% 1.72/1.93 =========== start of search ===========
% 1.72/1.93
% 1.72/1.93 -------- PROOF --------
% 1.72/1.93
% 1.72/1.93 ----> UNIT CONFLICT at 0.12 sec ----> 1642 [binary,1640.1,6.1] $F.
% 1.72/1.93
% 1.72/1.93 Length of proof is 11. Level of proof is 4.
% 1.72/1.93
% 1.72/1.93 ---------------- PROOF ----------------
% 1.72/1.93 % SZS status Unsatisfiable
% 1.72/1.93 % SZS output start Refutation
% See solution above
% 1.72/1.93 ------------ end of proof -------------
% 1.72/1.93
% 1.72/1.93
% 1.72/1.93 Search stopped by max_proofs option.
% 1.72/1.93
% 1.72/1.93
% 1.72/1.93 Search stopped by max_proofs option.
% 1.72/1.93
% 1.72/1.93 ============ end of search ============
% 1.72/1.93
% 1.72/1.93 -------------- statistics -------------
% 1.72/1.93 clauses given 86
% 1.72/1.93 clauses generated 2461
% 1.72/1.93 clauses kept 1327
% 1.72/1.93 clauses forward subsumed 1159
% 1.72/1.93 clauses back subsumed 14
% 1.72/1.93 Kbytes malloced 3906
% 1.72/1.93
% 1.72/1.93 ----------- times (seconds) -----------
% 1.72/1.93 user CPU time 0.12 (0 hr, 0 min, 0 sec)
% 1.72/1.93 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.93 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.72/1.93
% 1.72/1.93 That finishes the proof of the theorem.
% 1.72/1.93
% 1.72/1.93 Process 22551 finished Wed Jul 27 02:03:39 2022
% 1.72/1.93 Otter interrupted
% 1.72/1.93 PROOF FOUND
%------------------------------------------------------------------------------