TSTP Solution File: REL003-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : REL003-1 : TPTP v8.1.0. Released v4.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:11:46 EDT 2022
% Result : Unsatisfiable 1.94s 2.15s
% Output : Refutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 6 unt; 1 nHn; 5 RR)
% Number of literals : 10 ( 9 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 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 : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( join(sk1,sk2) != sk2
| join(converse(sk1),converse(sk2)) != converse(sk2) ),
file('REL003-1.p',unknown),
[] ).
cnf(2,axiom,
A = A,
file('REL003-1.p',unknown),
[] ).
cnf(22,axiom,
converse(converse(A)) = A,
file('REL003-1.p',unknown),
[] ).
cnf(23,axiom,
converse(join(A,B)) = join(converse(A),converse(B)),
file('REL003-1.p',unknown),
[] ).
cnf(35,axiom,
( join(sk1,sk2) = sk2
| join(converse(sk1),converse(sk2)) = converse(sk2) ),
file('REL003-1.p',unknown),
[] ).
cnf(259,plain,
join(converse(sk1),converse(sk2)) = converse(sk2),
inference(factor_simp,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[35,23])]),
[iquote('para_from,35.1.1,23.1.1.1,factor_simp')] ).
cnf(261,plain,
join(sk1,sk2) = sk2,
inference(factor_simp,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[35,23]),22,22,22])]),
[iquote('para_from,35.2.1,23.1.1.1,demod,22,22,22,factor_simp')] ).
cnf(263,plain,
$false,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1]),261,259]),2,2]),
[iquote('back_demod,1,demod,261,259,unit_del,2,2')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : REL003-1 : TPTP v8.1.0. Released v4.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 10:26:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.94/2.14 ----- Otter 3.3f, August 2004 -----
% 1.94/2.14 The process was started by sandbox on n023.cluster.edu,
% 1.94/2.14 Wed Jul 27 10:26:48 2022
% 1.94/2.14 The command was "./otter". The process ID is 17814.
% 1.94/2.14
% 1.94/2.14 set(prolog_style_variables).
% 1.94/2.14 set(auto).
% 1.94/2.14 dependent: set(auto1).
% 1.94/2.14 dependent: set(process_input).
% 1.94/2.14 dependent: clear(print_kept).
% 1.94/2.14 dependent: clear(print_new_demod).
% 1.94/2.14 dependent: clear(print_back_demod).
% 1.94/2.14 dependent: clear(print_back_sub).
% 1.94/2.14 dependent: set(control_memory).
% 1.94/2.14 dependent: assign(max_mem, 12000).
% 1.94/2.14 dependent: assign(pick_given_ratio, 4).
% 1.94/2.14 dependent: assign(stats_level, 1).
% 1.94/2.14 dependent: assign(max_seconds, 10800).
% 1.94/2.14 clear(print_given).
% 1.94/2.14
% 1.94/2.14 list(usable).
% 1.94/2.14 0 [] A=A.
% 1.94/2.14 0 [] join(A,B)=join(B,A).
% 1.94/2.14 0 [] join(A,join(B,C))=join(join(A,B),C).
% 1.94/2.14 0 [] A=join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))).
% 1.94/2.14 0 [] meet(A,B)=complement(join(complement(A),complement(B))).
% 1.94/2.14 0 [] composition(A,composition(B,C))=composition(composition(A,B),C).
% 1.94/2.14 0 [] composition(A,one)=A.
% 1.94/2.14 0 [] composition(join(A,B),C)=join(composition(A,C),composition(B,C)).
% 1.94/2.14 0 [] converse(converse(A))=A.
% 1.94/2.14 0 [] converse(join(A,B))=join(converse(A),converse(B)).
% 1.94/2.14 0 [] converse(composition(A,B))=composition(converse(B),converse(A)).
% 1.94/2.14 0 [] join(composition(converse(A),complement(composition(A,B))),complement(B))=complement(B).
% 1.94/2.14 0 [] top=join(A,complement(A)).
% 1.94/2.14 0 [] zero=meet(A,complement(A)).
% 1.94/2.14 0 [] join(sk1,sk2)=sk2|join(converse(sk1),converse(sk2))=converse(sk2).
% 1.94/2.14 0 [] join(sk1,sk2)!=sk2|join(converse(sk1),converse(sk2))!=converse(sk2).
% 1.94/2.14 end_of_list.
% 1.94/2.14
% 1.94/2.14 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 1.94/2.14
% 1.94/2.14 This ia a non-Horn set with equality. The strategy will be
% 1.94/2.14 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.94/2.14 deletion, with positive clauses in sos and nonpositive
% 1.94/2.14 clauses in usable.
% 1.94/2.14
% 1.94/2.14 dependent: set(knuth_bendix).
% 1.94/2.14 dependent: set(anl_eq).
% 1.94/2.14 dependent: set(para_from).
% 1.94/2.14 dependent: set(para_into).
% 1.94/2.14 dependent: clear(para_from_right).
% 1.94/2.14 dependent: clear(para_into_right).
% 1.94/2.14 dependent: set(para_from_vars).
% 1.94/2.14 dependent: set(eq_units_both_ways).
% 1.94/2.14 dependent: set(dynamic_demod_all).
% 1.94/2.14 dependent: set(dynamic_demod).
% 1.94/2.14 dependent: set(order_eq).
% 1.94/2.14 dependent: set(back_demod).
% 1.94/2.14 dependent: set(lrpo).
% 1.94/2.14 dependent: set(hyper_res).
% 1.94/2.14 dependent: set(unit_deletion).
% 1.94/2.14 dependent: set(factor).
% 1.94/2.14
% 1.94/2.14 ------------> process usable:
% 1.94/2.14 ** KEPT (pick-wt=13): 1 [] join(sk1,sk2)!=sk2|join(converse(sk1),converse(sk2))!=converse(sk2).
% 1.94/2.14
% 1.94/2.14 ------------> process sos:
% 1.94/2.14 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.94/2.14 ** KEPT (pick-wt=7): 3 [] join(A,B)=join(B,A).
% 1.94/2.14 ** KEPT (pick-wt=11): 5 [copy,4,flip.1] join(join(A,B),C)=join(A,join(B,C)).
% 1.94/2.14 ---> New Demodulator: 6 [new_demod,5] join(join(A,B),C)=join(A,join(B,C)).
% 1.94/2.14 ** KEPT (pick-wt=14): 8 [copy,7,flip.1] join(complement(join(complement(A),complement(B))),complement(join(complement(A),B)))=A.
% 1.94/2.14 ---> New Demodulator: 9 [new_demod,8] join(complement(join(complement(A),complement(B))),complement(join(complement(A),B)))=A.
% 1.94/2.14 ** KEPT (pick-wt=10): 11 [copy,10,flip.1] complement(join(complement(A),complement(B)))=meet(A,B).
% 1.94/2.14 ---> New Demodulator: 12 [new_demod,11] complement(join(complement(A),complement(B)))=meet(A,B).
% 1.94/2.14 ** KEPT (pick-wt=11): 14 [copy,13,flip.1] composition(composition(A,B),C)=composition(A,composition(B,C)).
% 1.94/2.14 ---> New Demodulator: 15 [new_demod,14] composition(composition(A,B),C)=composition(A,composition(B,C)).
% 1.94/2.14 ** KEPT (pick-wt=5): 16 [] composition(A,one)=A.
% 1.94/2.14 ---> New Demodulator: 17 [new_demod,16] composition(A,one)=A.
% 1.94/2.14 ** KEPT (pick-wt=13): 19 [copy,18,flip.1] join(composition(A,B),composition(C,B))=composition(join(A,C),B).
% 1.94/2.14 ---> New Demodulator: 20 [new_demod,19] join(composition(A,B),composition(C,B))=composition(join(A,C),B).
% 1.94/2.14 ** KEPT (pick-wt=5): 21 [] converse(converse(A))=A.
% 1.94/2.14 ---> New Demodulator: 22 [new_demod,21] converse(converse(A))=A.
% 1.94/2.14 ** KEPT (pick-wt=10): 23 [] converse(join(A,B))=join(converse(A),converse(B)).
% 1.94/2.14 ---> New Demodulator: 24 [new_demod,23] converse(join(A,B))=join(converse(A),converse(B)).
% 1.94/2.14 ** KEPT (pick-wt=10): 25 [] converse(composition(A,B))=composition(converse(B),converse(A)).
% 1.94/2.14 ---> New Demodulator: 26 [new_demod,25] converse(composition(A,B))=composition(converse(B),converse(A)).
% 1.94/2.15 ** KEPT (pick-wt=13): 27 [] join(composition(converse(A),complement(composition(A,B))),complement(B))=complement(B).
% 1.94/2.15 ---> New Demodulator: 28 [new_demod,27] join(composition(converse(A),complement(composition(A,B))),complement(B))=complement(B).
% 1.94/2.15 ** KEPT (pick-wt=6): 30 [copy,29,flip.1] join(A,complement(A))=top.
% 1.94/2.15 ---> New Demodulator: 31 [new_demod,30] join(A,complement(A))=top.
% 1.94/2.15 ** KEPT (pick-wt=6): 33 [copy,32,flip.1] meet(A,complement(A))=zero.
% 1.94/2.15 ---> New Demodulator: 34 [new_demod,33] meet(A,complement(A))=zero.
% 1.94/2.15 ** KEPT (pick-wt=13): 35 [] join(sk1,sk2)=sk2|join(converse(sk1),converse(sk2))=converse(sk2).
% 1.94/2.15 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.94/2.15 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] join(A,B)=join(B,A).
% 1.94/2.15 >>>> Starting back demodulation with 6.
% 1.94/2.15 >>>> Starting back demodulation with 9.
% 1.94/2.15 >>>> Starting back demodulation with 12.
% 1.94/2.15 >> back demodulating 8 with 12.
% 1.94/2.15 >>>> Starting back demodulation with 15.
% 1.94/2.15 >>>> Starting back demodulation with 17.
% 1.94/2.15 >>>> Starting back demodulation with 20.
% 1.94/2.15 >>>> Starting back demodulation with 22.
% 1.94/2.15 >>>> Starting back demodulation with 24.
% 1.94/2.15 >>>> Starting back demodulation with 26.
% 1.94/2.15 >>>> Starting back demodulation with 28.
% 1.94/2.15 >>>> Starting back demodulation with 31.
% 1.94/2.15 >>>> Starting back demodulation with 34.
% 1.94/2.15 >>>> Starting back demodulation with 37.
% 1.94/2.15
% 1.94/2.15 ======= end of input processing =======
% 1.94/2.15
% 1.94/2.15 =========== start of search ===========
% 1.94/2.15
% 1.94/2.15 -------- PROOF --------
% 1.94/2.15
% 1.94/2.15 -----> EMPTY CLAUSE at 0.01 sec ----> 263 [back_demod,1,demod,261,259,unit_del,2,2] $F.
% 1.94/2.15
% 1.94/2.15 Length of proof is 2. Level of proof is 1.
% 1.94/2.15
% 1.94/2.15 ---------------- PROOF ----------------
% 1.94/2.15 % SZS status Unsatisfiable
% 1.94/2.15 % SZS output start Refutation
% See solution above
% 1.94/2.15 ------------ end of proof -------------
% 1.94/2.15
% 1.94/2.15
% 1.94/2.15 Search stopped by max_proofs option.
% 1.94/2.15
% 1.94/2.15
% 1.94/2.15 Search stopped by max_proofs option.
% 1.94/2.15
% 1.94/2.15 ============ end of search ============
% 1.94/2.15
% 1.94/2.15 -------------- statistics -------------
% 1.94/2.15 clauses given 41
% 1.94/2.15 clauses generated 306
% 1.94/2.15 clauses kept 136
% 1.94/2.15 clauses forward subsumed 229
% 1.94/2.15 clauses back subsumed 0
% 1.94/2.15 Kbytes malloced 1953
% 1.94/2.15
% 1.94/2.15 ----------- times (seconds) -----------
% 1.94/2.15 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.94/2.15 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.94/2.15 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.94/2.15
% 1.94/2.15 That finishes the proof of the theorem.
% 1.94/2.15
% 1.94/2.15 Process 17814 finished Wed Jul 27 10:26:50 2022
% 1.94/2.15 Otter interrupted
% 1.94/2.15 PROOF FOUND
%------------------------------------------------------------------------------