TSTP Solution File: LAT008-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT008-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n005.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:01:46 EDT 2022
% Result : Unsatisfiable 1.48s 1.70s
% Output : Refutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 3 RR)
% Number of literals : 24 ( 23 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
join(a,meet(a,b)) != a,
file('LAT008-1.p',unknown),
[] ).
cnf(4,axiom,
meet(A,join(A,B)) = A,
file('LAT008-1.p',unknown),
[] ).
cnf(5,axiom,
meet(A,join(B,C)) = join(meet(C,A),meet(B,A)),
file('LAT008-1.p',unknown),
[] ).
cnf(6,plain,
join(meet(A,B),meet(C,B)) = meet(B,join(C,A)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[5])]),
[iquote('copy,5,flip.1')] ).
cnf(8,plain,
join(meet(A,B),meet(B,B)) = B,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[5,4])]),
[iquote('para_into,5.1.1,3.1.1,flip.1')] ).
cnf(11,plain,
join(A,meet(join(A,B),join(A,B))) = join(A,B),
inference(para_into,[status(thm),theory(equality)],[8,4]),
[iquote('para_into,7.1.1.1,3.1.1')] ).
cnf(16,plain,
meet(meet(A,B),B) = meet(A,B),
inference(para_from,[status(thm),theory(equality)],[8,4]),
[iquote('para_from,7.1.1,3.1.1.2')] ).
cnf(36,plain,
meet(meet(A,B),meet(B,join(C,A))) = meet(A,B),
inference(para_from,[status(thm),theory(equality)],[6,4]),
[iquote('para_from,6.1.1,3.1.1.2')] ).
cnf(43,plain,
join(A,join(meet(B,join(A,B)),A)) = join(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[11,5]),4]),
[iquote('para_into,11.1.1.2,5.1.1,demod,4')] ).
cnf(91,plain,
join(A,join(A,A)) = join(A,A),
inference(para_into,[status(thm),theory(equality)],[43,4]),
[iquote('para_into,43.1.1.2.1,3.1.1')] ).
cnf(139,plain,
join(meet(A,A),A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[91,8]),8]),
[iquote('para_into,91.1.1.2,7.1.1,demod,8')] ).
cnf(155,plain,
meet(meet(A,B),meet(B,A)) = meet(A,B),
inference(para_from,[status(thm),theory(equality)],[139,36]),
[iquote('para_from,139.1.1,36.1.1.2.2')] ).
cnf(159,plain,
meet(A,B) = join(meet(B,A),meet(meet(B,B),A)),
inference(para_from,[status(thm),theory(equality)],[139,5]),
[iquote('para_from,139.1.1,5.1.1.2')] ).
cnf(160,plain,
join(meet(A,B),meet(meet(A,A),B)) = meet(B,A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[159])]),
[iquote('copy,159,flip.1')] ).
cnf(190,plain,
meet(A,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[155,139]),8])]),
[iquote('para_from,155.1.1,139.1.1.1,demod,8,flip.1')] ).
cnf(209,plain,
join(meet(A,B),meet(A,B)) = meet(B,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[160]),190]),
[iquote('back_demod,160,demod,190')] ).
cnf(216,plain,
join(A,A) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[139]),190]),
[iquote('back_demod,139,demod,190')] ).
cnf(269,plain,
meet(A,B) = meet(B,A),
inference(demod,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[209])]),216]),
[iquote('copy,209,flip.1,demod,216')] ).
cnf(292,plain,
meet(A,meet(A,join(B,A))) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[190,36]),190]),
[iquote('para_from,189.1.1,36.1.1.1,demod,190')] ).
cnf(305,plain,
meet(join(A,B),C) = join(meet(B,C),meet(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[269,5])]),
[iquote('para_into,269.1.1,5.1.1,flip.1')] ).
cnf(359,plain,
meet(meet(A,B),A) = meet(B,A),
inference(para_from,[status(thm),theory(equality)],[269,16]),
[iquote('para_from,269.1.1,16.1.1.1')] ).
cnf(361,plain,
join(a,meet(b,a)) != a,
inference(para_from,[status(thm),theory(equality)],[269,1]),
[iquote('para_from,269.1.1,1.1.1.2')] ).
cnf(400,plain,
join(A,meet(B,A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[292,269]),359,305,190]),
[iquote('para_into,292.1.1,269.1.1,demod,359,305,190')] ).
cnf(402,plain,
$false,
inference(binary,[status(thm)],[400,361]),
[iquote('binary,400.1,361.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT008-1 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n005.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 08:32:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.48/1.70 ----- Otter 3.3f, August 2004 -----
% 1.48/1.70 The process was started by sandbox on n005.cluster.edu,
% 1.48/1.70 Wed Jul 27 08:32:05 2022
% 1.48/1.70 The command was "./otter". The process ID is 7862.
% 1.48/1.70
% 1.48/1.70 set(prolog_style_variables).
% 1.48/1.70 set(auto).
% 1.48/1.70 dependent: set(auto1).
% 1.48/1.70 dependent: set(process_input).
% 1.48/1.70 dependent: clear(print_kept).
% 1.48/1.70 dependent: clear(print_new_demod).
% 1.48/1.70 dependent: clear(print_back_demod).
% 1.48/1.70 dependent: clear(print_back_sub).
% 1.48/1.70 dependent: set(control_memory).
% 1.48/1.70 dependent: assign(max_mem, 12000).
% 1.48/1.70 dependent: assign(pick_given_ratio, 4).
% 1.48/1.70 dependent: assign(stats_level, 1).
% 1.48/1.70 dependent: assign(max_seconds, 10800).
% 1.48/1.70 clear(print_given).
% 1.48/1.70
% 1.48/1.70 list(usable).
% 1.48/1.70 0 [] A=A.
% 1.48/1.70 0 [] meet(X,join(X,Y))=X.
% 1.48/1.70 0 [] meet(X,join(Y,Z))=join(meet(Z,X),meet(Y,X)).
% 1.48/1.70 0 [] join(a,meet(a,b))!=a.
% 1.48/1.70 end_of_list.
% 1.48/1.70
% 1.48/1.70 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.48/1.70
% 1.48/1.70 All clauses are units, and equality is present; the
% 1.48/1.70 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.48/1.70
% 1.48/1.70 dependent: set(knuth_bendix).
% 1.48/1.70 dependent: set(anl_eq).
% 1.48/1.70 dependent: set(para_from).
% 1.48/1.70 dependent: set(para_into).
% 1.48/1.70 dependent: clear(para_from_right).
% 1.48/1.70 dependent: clear(para_into_right).
% 1.48/1.70 dependent: set(para_from_vars).
% 1.48/1.70 dependent: set(eq_units_both_ways).
% 1.48/1.70 dependent: set(dynamic_demod_all).
% 1.48/1.70 dependent: set(dynamic_demod).
% 1.48/1.70 dependent: set(order_eq).
% 1.48/1.70 dependent: set(back_demod).
% 1.48/1.70 dependent: set(lrpo).
% 1.48/1.70
% 1.48/1.70 ------------> process usable:
% 1.48/1.70 ** KEPT (pick-wt=7): 1 [] join(a,meet(a,b))!=a.
% 1.48/1.70
% 1.48/1.70 ------------> process sos:
% 1.48/1.70 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.48/1.70 ** KEPT (pick-wt=7): 3 [] meet(A,join(A,B))=A.
% 1.48/1.70 ---> New Demodulator: 4 [new_demod,3] meet(A,join(A,B))=A.
% 1.48/1.70 ** KEPT (pick-wt=13): 5 [] meet(A,join(B,C))=join(meet(C,A),meet(B,A)).
% 1.48/1.70 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.48/1.70 >>>> Starting back demodulation with 4.
% 1.48/1.70 ** KEPT (pick-wt=13): 6 [copy,5,flip.1] join(meet(A,B),meet(C,B))=meet(B,join(C,A)).
% 1.48/1.70 Following clause subsumed by 5 during input processing: 0 [copy,6,flip.1] meet(A,join(B,C))=join(meet(C,A),meet(B,A)).
% 1.48/1.70
% 1.48/1.70 ======= end of input processing =======
% 1.48/1.70
% 1.48/1.70 =========== start of search ===========
% 1.48/1.70
% 1.48/1.70 -------- PROOF --------
% 1.48/1.70
% 1.48/1.70 ----> UNIT CONFLICT at 0.01 sec ----> 402 [binary,400.1,361.1] $F.
% 1.48/1.70
% 1.48/1.70 Length of proof is 20. Level of proof is 11.
% 1.48/1.70
% 1.48/1.70 ---------------- PROOF ----------------
% 1.48/1.70 % SZS status Unsatisfiable
% 1.48/1.70 % SZS output start Refutation
% See solution above
% 1.48/1.70 ------------ end of proof -------------
% 1.48/1.70
% 1.48/1.70
% 1.48/1.70 Search stopped by max_proofs option.
% 1.48/1.70
% 1.48/1.70
% 1.48/1.70 Search stopped by max_proofs option.
% 1.48/1.70
% 1.48/1.70 ============ end of search ============
% 1.48/1.70
% 1.48/1.70 -------------- statistics -------------
% 1.48/1.70 clauses given 25
% 1.48/1.70 clauses generated 364
% 1.48/1.70 clauses kept 244
% 1.48/1.70 clauses forward subsumed 326
% 1.48/1.70 clauses back subsumed 0
% 1.48/1.70 Kbytes malloced 2929
% 1.48/1.70
% 1.48/1.70 ----------- times (seconds) -----------
% 1.48/1.70 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.48/1.70 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.48/1.70 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.48/1.70
% 1.48/1.70 That finishes the proof of the theorem.
% 1.48/1.70
% 1.48/1.70 Process 7862 finished Wed Jul 27 08:32:06 2022
% 1.48/1.70 Otter interrupted
% 1.48/1.70 PROOF FOUND
%------------------------------------------------------------------------------