TSTP Solution File: LAT012-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT012-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n011.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:47 EDT 2022
% Result : Unsatisfiable 2.04s 2.24s
% Output : Refutation 2.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 2 RR)
% Number of literals : 18 ( 17 equ; 1 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 : 36 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
meet(b,a) != meet(a,b),
file('LAT012-1.p',unknown),
[] ).
cnf(3,axiom,
join(A,meet(B,meet(A,C))) = A,
file('LAT012-1.p',unknown),
[] ).
cnf(5,axiom,
meet(A,join(B,join(A,C))) = A,
file('LAT012-1.p',unknown),
[] ).
cnf(7,axiom,
join(join(meet(A,B),meet(B,C)),B) = B,
file('LAT012-1.p',unknown),
[] ).
cnf(9,axiom,
meet(meet(join(A,B),join(B,C)),B) = B,
file('LAT012-1.p',unknown),
[] ).
cnf(11,plain,
meet(A,join(B,A)) = A,
inference(para_into,[status(thm),theory(equality)],[5,3]),
[iquote('para_into,5.1.1.2.2,3.1.1')] ).
cnf(13,plain,
join(A,meet(B,A)) = A,
inference(para_from,[status(thm),theory(equality)],[5,3]),
[iquote('para_from,5.1.1,3.1.1.2.2')] ).
cnf(18,plain,
join(join(A,B),B) = join(A,B),
inference(para_into,[status(thm),theory(equality)],[13,11]),
[iquote('para_into,13.1.1.2,11.1.1')] ).
cnf(27,plain,
join(meet(A,B),B) = B,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[7,11]),18]),
[iquote('para_into,7.1.1.1.2,11.1.1,demod,18')] ).
cnf(31,plain,
meet(A,A) = A,
inference(para_from,[status(thm),theory(equality)],[7,11]),
[iquote('para_from,7.1.1,11.1.1.2')] ).
cnf(40,plain,
join(A,meet(A,B)) = A,
inference(para_from,[status(thm),theory(equality)],[31,3]),
[iquote('para_from,31.1.1,3.1.1.2')] ).
cnf(41,plain,
join(A,join(B,A)) = join(B,A),
inference(para_into,[status(thm),theory(equality)],[27,11]),
[iquote('para_into,27.1.1.1,11.1.1')] ).
cnf(55,plain,
meet(meet(A,join(meet(B,A),C)),meet(B,A)) = meet(B,A),
inference(para_into,[status(thm),theory(equality)],[9,13]),
[iquote('para_into,9.1.1.1.1,13.1.1')] ).
cnf(71,plain,
meet(meet(A,B),A) = meet(A,B),
inference(para_from,[status(thm),theory(equality)],[40,11]),
[iquote('para_from,39.1.1,11.1.1.2')] ).
cnf(95,plain,
join(meet(A,B),A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[41,40]),40]),
[iquote('para_into,41.1.1.2,39.1.1,demod,40')] ).
cnf(928,plain,
meet(meet(A,B),meet(B,A)) = meet(B,A),
inference(para_into,[status(thm),theory(equality)],[55,95]),
[iquote('para_into,55.1.1.1.2,95.1.1')] ).
cnf(1145,plain,
meet(A,B) = meet(B,A),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[928,71]),928,928]),
[iquote('para_from,927.1.1,71.1.1.1,demod,928,928')] ).
cnf(1146,plain,
$false,
inference(binary,[status(thm)],[1145,1]),
[iquote('binary,1145.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LAT012-1 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n011.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 08:17:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.04/2.24 ----- Otter 3.3f, August 2004 -----
% 2.04/2.24 The process was started by sandbox on n011.cluster.edu,
% 2.04/2.24 Wed Jul 27 08:17:40 2022
% 2.04/2.24 The command was "./otter". The process ID is 15583.
% 2.04/2.24
% 2.04/2.24 set(prolog_style_variables).
% 2.04/2.24 set(auto).
% 2.04/2.24 dependent: set(auto1).
% 2.04/2.24 dependent: set(process_input).
% 2.04/2.24 dependent: clear(print_kept).
% 2.04/2.24 dependent: clear(print_new_demod).
% 2.04/2.24 dependent: clear(print_back_demod).
% 2.04/2.24 dependent: clear(print_back_sub).
% 2.04/2.24 dependent: set(control_memory).
% 2.04/2.24 dependent: assign(max_mem, 12000).
% 2.04/2.24 dependent: assign(pick_given_ratio, 4).
% 2.04/2.24 dependent: assign(stats_level, 1).
% 2.04/2.24 dependent: assign(max_seconds, 10800).
% 2.04/2.24 clear(print_given).
% 2.04/2.24
% 2.04/2.24 list(usable).
% 2.04/2.24 0 [] A=A.
% 2.04/2.24 0 [] join(X,meet(Y,meet(X,Z)))=X.
% 2.04/2.24 0 [] meet(X,join(Y,join(X,Z)))=X.
% 2.04/2.24 0 [] join(join(meet(X,Y),meet(Y,Z)),Y)=Y.
% 2.04/2.24 0 [] meet(meet(join(X,Y),join(Y,Z)),Y)=Y.
% 2.04/2.24 0 [] meet(b,a)!=meet(a,b).
% 2.04/2.24 end_of_list.
% 2.04/2.24
% 2.04/2.24 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 2.04/2.24
% 2.04/2.24 All clauses are units, and equality is present; the
% 2.04/2.24 strategy will be Knuth-Bendix with positive clauses in sos.
% 2.04/2.24
% 2.04/2.24 dependent: set(knuth_bendix).
% 2.04/2.24 dependent: set(anl_eq).
% 2.04/2.24 dependent: set(para_from).
% 2.04/2.24 dependent: set(para_into).
% 2.04/2.24 dependent: clear(para_from_right).
% 2.04/2.24 dependent: clear(para_into_right).
% 2.04/2.24 dependent: set(para_from_vars).
% 2.04/2.24 dependent: set(eq_units_both_ways).
% 2.04/2.24 dependent: set(dynamic_demod_all).
% 2.04/2.24 dependent: set(dynamic_demod).
% 2.04/2.24 dependent: set(order_eq).
% 2.04/2.24 dependent: set(back_demod).
% 2.04/2.24 dependent: set(lrpo).
% 2.04/2.24
% 2.04/2.24 ------------> process usable:
% 2.04/2.24 ** KEPT (pick-wt=7): 1 [] meet(b,a)!=meet(a,b).
% 2.04/2.24
% 2.04/2.24 ------------> process sos:
% 2.04/2.24 ** KEPT (pick-wt=3): 2 [] A=A.
% 2.04/2.24 ** KEPT (pick-wt=9): 3 [] join(A,meet(B,meet(A,C)))=A.
% 2.04/2.24 ---> New Demodulator: 4 [new_demod,3] join(A,meet(B,meet(A,C)))=A.
% 2.04/2.24 ** KEPT (pick-wt=9): 5 [] meet(A,join(B,join(A,C)))=A.
% 2.04/2.24 ---> New Demodulator: 6 [new_demod,5] meet(A,join(B,join(A,C)))=A.
% 2.04/2.24 ** KEPT (pick-wt=11): 7 [] join(join(meet(A,B),meet(B,C)),B)=B.
% 2.04/2.24 ---> New Demodulator: 8 [new_demod,7] join(join(meet(A,B),meet(B,C)),B)=B.
% 2.04/2.24 ** KEPT (pick-wt=11): 9 [] meet(meet(join(A,B),join(B,C)),B)=B.
% 2.04/2.24 ---> New Demodulator: 10 [new_demod,9] meet(meet(join(A,B),join(B,C)),B)=B.
% 2.04/2.24 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 2.04/2.24 >>>> Starting back demodulation with 4.
% 2.04/2.24 >>>> Starting back demodulation with 6.
% 2.04/2.24 >>>> Starting back demodulation with 8.
% 2.04/2.24 >>>> Starting back demodulation with 10.
% 2.04/2.24
% 2.04/2.24 ======= end of input processing =======
% 2.04/2.24
% 2.04/2.24 =========== start of search ===========
% 2.04/2.24
% 2.04/2.24
% 2.04/2.24 Resetting weight limit to 11.
% 2.04/2.24
% 2.04/2.24
% 2.04/2.24 Resetting weight limit to 11.
% 2.04/2.24
% 2.04/2.24 sos_size=498
% 2.04/2.24
% 2.04/2.24 -------- PROOF --------
% 2.04/2.24
% 2.04/2.24 ----> UNIT CONFLICT at 0.12 sec ----> 1146 [binary,1145.1,1.1] $F.
% 2.04/2.24
% 2.04/2.24 Length of proof is 12. Level of proof is 7.
% 2.04/2.24
% 2.04/2.24 ---------------- PROOF ----------------
% 2.04/2.24 % SZS status Unsatisfiable
% 2.04/2.24 % SZS output start Refutation
% See solution above
% 2.04/2.24 ------------ end of proof -------------
% 2.04/2.24
% 2.04/2.24
% 2.04/2.24 Search stopped by max_proofs option.
% 2.04/2.24
% 2.04/2.24
% 2.04/2.24 Search stopped by max_proofs option.
% 2.04/2.24
% 2.04/2.24 ============ end of search ============
% 2.04/2.24
% 2.04/2.24 -------------- statistics -------------
% 2.04/2.24 clauses given 110
% 2.04/2.24 clauses generated 13082
% 2.04/2.24 clauses kept 575
% 2.04/2.24 clauses forward subsumed 9543
% 2.04/2.24 clauses back subsumed 0
% 2.04/2.24 Kbytes malloced 4882
% 2.04/2.24
% 2.04/2.24 ----------- times (seconds) -----------
% 2.04/2.24 user CPU time 0.12 (0 hr, 0 min, 0 sec)
% 2.04/2.24 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.04/2.24 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.04/2.24
% 2.04/2.24 That finishes the proof of the theorem.
% 2.04/2.24
% 2.04/2.24 Process 15583 finished Wed Jul 27 08:17:42 2022
% 2.04/2.24 Otter interrupted
% 2.04/2.24 PROOF FOUND
%------------------------------------------------------------------------------