TSTP Solution File: LAT014-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT014-1 : TPTP v8.1.0. Released v2.2.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:01:47 EDT 2022
% Result : Unsatisfiable 1.69s 1.90s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 5 unt; 0 nHn; 2 RR)
% Number of literals : 5 ( 4 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 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 : 8 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
meet(a,join(a,b)) != a,
file('LAT014-1.p',unknown),
[] ).
cnf(5,axiom,
meet(A,join(B,join(A,C))) = A,
file('LAT014-1.p',unknown),
[] ).
cnf(7,axiom,
join(join(meet(A,B),meet(B,C)),B) = B,
file('LAT014-1.p',unknown),
[] ).
cnf(33,plain,
meet(A,join(A,B)) = A,
inference(para_from,[status(thm),theory(equality)],[7,5]),
[iquote('para_from,7.1.1,5.1.1.2')] ).
cnf(35,plain,
$false,
inference(binary,[status(thm)],[33,1]),
[iquote('binary,33.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT014-1 : TPTP v8.1.0. Released v2.2.0.
% 0.07/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 08:18:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.69/1.90 ----- Otter 3.3f, August 2004 -----
% 1.69/1.90 The process was started by sandbox2 on n021.cluster.edu,
% 1.69/1.90 Wed Jul 27 08:18:08 2022
% 1.69/1.90 The command was "./otter". The process ID is 3575.
% 1.69/1.90
% 1.69/1.90 set(prolog_style_variables).
% 1.69/1.90 set(auto).
% 1.69/1.90 dependent: set(auto1).
% 1.69/1.90 dependent: set(process_input).
% 1.69/1.90 dependent: clear(print_kept).
% 1.69/1.90 dependent: clear(print_new_demod).
% 1.69/1.90 dependent: clear(print_back_demod).
% 1.69/1.90 dependent: clear(print_back_sub).
% 1.69/1.90 dependent: set(control_memory).
% 1.69/1.90 dependent: assign(max_mem, 12000).
% 1.69/1.90 dependent: assign(pick_given_ratio, 4).
% 1.69/1.90 dependent: assign(stats_level, 1).
% 1.69/1.90 dependent: assign(max_seconds, 10800).
% 1.69/1.90 clear(print_given).
% 1.69/1.90
% 1.69/1.90 list(usable).
% 1.69/1.90 0 [] A=A.
% 1.69/1.90 0 [] join(X,meet(Y,meet(X,Z)))=X.
% 1.69/1.90 0 [] meet(X,join(Y,join(X,Z)))=X.
% 1.69/1.90 0 [] join(join(meet(X,Y),meet(Y,Z)),Y)=Y.
% 1.69/1.90 0 [] meet(meet(join(X,Y),join(Y,Z)),Y)=Y.
% 1.69/1.90 0 [] meet(a,join(a,b))!=a.
% 1.69/1.90 end_of_list.
% 1.69/1.90
% 1.69/1.90 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.69/1.90
% 1.69/1.90 All clauses are units, and equality is present; the
% 1.69/1.90 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.69/1.90
% 1.69/1.90 dependent: set(knuth_bendix).
% 1.69/1.90 dependent: set(anl_eq).
% 1.69/1.90 dependent: set(para_from).
% 1.69/1.90 dependent: set(para_into).
% 1.69/1.90 dependent: clear(para_from_right).
% 1.69/1.90 dependent: clear(para_into_right).
% 1.69/1.90 dependent: set(para_from_vars).
% 1.69/1.90 dependent: set(eq_units_both_ways).
% 1.69/1.90 dependent: set(dynamic_demod_all).
% 1.69/1.90 dependent: set(dynamic_demod).
% 1.69/1.90 dependent: set(order_eq).
% 1.69/1.90 dependent: set(back_demod).
% 1.69/1.90 dependent: set(lrpo).
% 1.69/1.90
% 1.69/1.90 ------------> process usable:
% 1.69/1.90 ** KEPT (pick-wt=7): 1 [] meet(a,join(a,b))!=a.
% 1.69/1.90
% 1.69/1.90 ------------> process sos:
% 1.69/1.90 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.69/1.90 ** KEPT (pick-wt=9): 3 [] join(A,meet(B,meet(A,C)))=A.
% 1.69/1.90 ---> New Demodulator: 4 [new_demod,3] join(A,meet(B,meet(A,C)))=A.
% 1.69/1.90 ** KEPT (pick-wt=9): 5 [] meet(A,join(B,join(A,C)))=A.
% 1.69/1.90 ---> New Demodulator: 6 [new_demod,5] meet(A,join(B,join(A,C)))=A.
% 1.69/1.90 ** KEPT (pick-wt=11): 7 [] join(join(meet(A,B),meet(B,C)),B)=B.
% 1.69/1.90 ---> New Demodulator: 8 [new_demod,7] join(join(meet(A,B),meet(B,C)),B)=B.
% 1.69/1.90 ** KEPT (pick-wt=11): 9 [] meet(meet(join(A,B),join(B,C)),B)=B.
% 1.69/1.90 ---> New Demodulator: 10 [new_demod,9] meet(meet(join(A,B),join(B,C)),B)=B.
% 1.69/1.90 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.69/1.90 >>>> Starting back demodulation with 4.
% 1.69/1.90 >>>> Starting back demodulation with 6.
% 1.69/1.90 >>>> Starting back demodulation with 8.
% 1.69/1.90 >>>> Starting back demodulation with 10.
% 1.69/1.90
% 1.69/1.90 ======= end of input processing =======
% 1.69/1.90
% 1.69/1.90 =========== start of search ===========
% 1.69/1.90
% 1.69/1.90 -------- PROOF --------
% 1.69/1.90
% 1.69/1.90 ----> UNIT CONFLICT at 0.00 sec ----> 35 [binary,33.1,1.1] $F.
% 1.69/1.90
% 1.69/1.90 Length of proof is 1. Level of proof is 1.
% 1.69/1.90
% 1.69/1.90 ---------------- PROOF ----------------
% 1.69/1.90 % SZS status Unsatisfiable
% 1.69/1.90 % SZS output start Refutation
% See solution above
% 1.69/1.90 ------------ end of proof -------------
% 1.69/1.90
% 1.69/1.90
% 1.69/1.90 Search stopped by max_proofs option.
% 1.69/1.90
% 1.69/1.90
% 1.69/1.90 Search stopped by max_proofs option.
% 1.69/1.90
% 1.69/1.90 ============ end of search ============
% 1.69/1.90
% 1.69/1.90 -------------- statistics -------------
% 1.69/1.90 clauses given 6
% 1.69/1.90 clauses generated 26
% 1.69/1.90 clauses kept 18
% 1.69/1.90 clauses forward subsumed 15
% 1.69/1.90 clauses back subsumed 0
% 1.69/1.90 Kbytes malloced 976
% 1.69/1.90
% 1.69/1.90 ----------- times (seconds) -----------
% 1.69/1.90 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.69/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.69/1.90 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.69/1.90
% 1.69/1.90 That finishes the proof of the theorem.
% 1.69/1.90
% 1.69/1.90 Process 3575 finished Wed Jul 27 08:18:09 2022
% 1.69/1.90 Otter interrupted
% 1.69/1.90 PROOF FOUND
%------------------------------------------------------------------------------