TSTP Solution File: COM007+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : COM007+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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 12:48:20 EDT 2022
% Result : Theorem 1.71s 1.91s
% Output : Refutation 1.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of clauses : 27 ( 10 unt; 10 nHn; 25 RR)
% Number of literals : 53 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ reflexive_rewrite(b,A)
| ~ reflexive_rewrite(c,A)
| goal ),
file('COM007+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ e_qualish(A,B)
| e_qualish(B,A) ),
file('COM007+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ e_qualish(A,B)
| ~ reflexive_rewrite(B,C)
| reflexive_rewrite(A,C) ),
file('COM007+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ e_qualish(A,B)
| reflexive_rewrite(A,B) ),
file('COM007+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ rewrite(A,B)
| reflexive_rewrite(A,B) ),
file('COM007+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ reflexive_rewrite(A,B)
| e_qualish(A,B)
| rewrite(A,B) ),
file('COM007+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ rewrite(A,B)
| ~ rewrite(A,C)
| rewrite(B,dollar_f1(A,B,C)) ),
file('COM007+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ rewrite(A,B)
| ~ rewrite(A,C)
| rewrite(C,dollar_f1(A,B,C)) ),
file('COM007+1.p',unknown),
[] ).
cnf(9,axiom,
~ goal,
file('COM007+1.p',unknown),
[] ).
cnf(11,axiom,
reflexive_rewrite(a,b),
file('COM007+1.p',unknown),
[] ).
cnf(12,axiom,
reflexive_rewrite(a,c),
file('COM007+1.p',unknown),
[] ).
cnf(13,axiom,
e_qualish(A,A),
file('COM007+1.p',unknown),
[] ).
cnf(14,plain,
( e_qualish(a,b)
| rewrite(a,b) ),
inference(hyper,[status(thm)],[11,6]),
[iquote('hyper,11,6')] ).
cnf(15,plain,
( e_qualish(a,c)
| rewrite(a,c) ),
inference(hyper,[status(thm)],[12,6]),
[iquote('hyper,12,6')] ).
cnf(16,plain,
reflexive_rewrite(A,A),
inference(hyper,[status(thm)],[13,4]),
[iquote('hyper,13,4')] ).
cnf(19,plain,
( e_qualish(a,c)
| rewrite(c,dollar_f1(a,b,c))
| e_qualish(a,b) ),
inference(hyper,[status(thm)],[15,8,14]),
[iquote('hyper,15,8,14')] ).
cnf(21,plain,
( e_qualish(a,c)
| rewrite(b,dollar_f1(a,b,c))
| e_qualish(a,b) ),
inference(hyper,[status(thm)],[15,7,14]),
[iquote('hyper,15,7,14')] ).
cnf(32,plain,
( e_qualish(a,c)
| e_qualish(a,b)
| reflexive_rewrite(c,dollar_f1(a,b,c)) ),
inference(hyper,[status(thm)],[19,5]),
[iquote('hyper,19,5')] ).
cnf(48,plain,
( e_qualish(a,c)
| e_qualish(a,b)
| reflexive_rewrite(b,dollar_f1(a,b,c)) ),
inference(hyper,[status(thm)],[21,5]),
[iquote('hyper,21,5')] ).
cnf(61,plain,
( e_qualish(a,c)
| e_qualish(a,b) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[48,1,32]),9])])]),
[iquote('hyper,48,1,32,unit_del,9,factor_simp,factor_simp')] ).
cnf(62,plain,
( e_qualish(a,b)
| e_qualish(c,a) ),
inference(hyper,[status(thm)],[61,2]),
[iquote('hyper,61,2')] ).
cnf(66,plain,
( e_qualish(a,b)
| reflexive_rewrite(c,b) ),
inference(hyper,[status(thm)],[62,3,11]),
[iquote('hyper,62,3,11')] ).
cnf(76,plain,
e_qualish(a,b),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[66,1,16]),9]),
[iquote('hyper,66,1,16,unit_del,9')] ).
cnf(79,plain,
e_qualish(b,a),
inference(hyper,[status(thm)],[76,2]),
[iquote('hyper,76,2')] ).
cnf(81,plain,
reflexive_rewrite(b,c),
inference(hyper,[status(thm)],[79,3,12]),
[iquote('hyper,79,3,12')] ).
cnf(83,plain,
goal,
inference(hyper,[status(thm)],[81,1,16]),
[iquote('hyper,81,1,16')] ).
cnf(84,plain,
$false,
inference(binary,[status(thm)],[83,9]),
[iquote('binary,83.1,9.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : COM007+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 06:50:51 EDT 2022
% 0.18/0.33 % CPUTime :
% 1.71/1.91 ----- Otter 3.3f, August 2004 -----
% 1.71/1.91 The process was started by sandbox on n027.cluster.edu,
% 1.71/1.91 Wed Jul 27 06:50:51 2022
% 1.71/1.91 The command was "./otter". The process ID is 16059.
% 1.71/1.91
% 1.71/1.91 set(prolog_style_variables).
% 1.71/1.91 set(auto).
% 1.71/1.91 dependent: set(auto1).
% 1.71/1.91 dependent: set(process_input).
% 1.71/1.91 dependent: clear(print_kept).
% 1.71/1.91 dependent: clear(print_new_demod).
% 1.71/1.91 dependent: clear(print_back_demod).
% 1.71/1.91 dependent: clear(print_back_sub).
% 1.71/1.91 dependent: set(control_memory).
% 1.71/1.91 dependent: assign(max_mem, 12000).
% 1.71/1.91 dependent: assign(pick_given_ratio, 4).
% 1.71/1.91 dependent: assign(stats_level, 1).
% 1.71/1.91 dependent: assign(max_seconds, 10800).
% 1.71/1.91 clear(print_given).
% 1.71/1.91
% 1.71/1.91 formula_list(usable).
% 1.71/1.91 reflexive_rewrite(a,b).
% 1.71/1.91 reflexive_rewrite(a,c).
% 1.71/1.91 all A (reflexive_rewrite(b,A)&reflexive_rewrite(c,A)->goal).
% 1.71/1.91 all A e_qualish(A,A).
% 1.71/1.91 all A B (e_qualish(A,B)->e_qualish(B,A)).
% 1.71/1.91 all A B C (e_qualish(A,B)&reflexive_rewrite(B,C)->reflexive_rewrite(A,C)).
% 1.71/1.91 all A B (e_qualish(A,B)->reflexive_rewrite(A,B)).
% 1.71/1.91 all A B (rewrite(A,B)->reflexive_rewrite(A,B)).
% 1.71/1.91 all A B (reflexive_rewrite(A,B)->e_qualish(A,B)|rewrite(A,B)).
% 1.71/1.91 all A B C (rewrite(A,B)&rewrite(A,C)-> (exists D (rewrite(B,D)&rewrite(C,D)))).
% 1.71/1.91 -goal.
% 1.71/1.91 end_of_list.
% 1.71/1.91
% 1.71/1.91 -------> usable clausifies to:
% 1.71/1.91
% 1.71/1.91 list(usable).
% 1.71/1.91 0 [] reflexive_rewrite(a,b).
% 1.71/1.91 0 [] reflexive_rewrite(a,c).
% 1.71/1.91 0 [] -reflexive_rewrite(b,A)| -reflexive_rewrite(c,A)|goal.
% 1.71/1.91 0 [] e_qualish(A,A).
% 1.71/1.91 0 [] -e_qualish(A,B)|e_qualish(B,A).
% 1.71/1.91 0 [] -e_qualish(A,B)| -reflexive_rewrite(B,C)|reflexive_rewrite(A,C).
% 1.71/1.91 0 [] -e_qualish(A,B)|reflexive_rewrite(A,B).
% 1.71/1.91 0 [] -rewrite(A,B)|reflexive_rewrite(A,B).
% 1.71/1.91 0 [] -reflexive_rewrite(A,B)|e_qualish(A,B)|rewrite(A,B).
% 1.71/1.91 0 [] -rewrite(A,B)| -rewrite(A,C)|rewrite(B,$f1(A,B,C)).
% 1.71/1.91 0 [] -rewrite(A,B)| -rewrite(A,C)|rewrite(C,$f1(A,B,C)).
% 1.71/1.91 0 [] -goal.
% 1.71/1.91 end_of_list.
% 1.71/1.91
% 1.71/1.91 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.71/1.91
% 1.71/1.91 This is a non-Horn set without equality. The strategy will
% 1.71/1.91 be ordered hyper_res, unit deletion, and factoring, with
% 1.71/1.91 satellites in sos and with nuclei in usable.
% 1.71/1.91
% 1.71/1.91 dependent: set(hyper_res).
% 1.71/1.91 dependent: set(factor).
% 1.71/1.91 dependent: set(unit_deletion).
% 1.71/1.91
% 1.71/1.91 ------------> process usable:
% 1.71/1.91 ** KEPT (pick-wt=7): 1 [] -reflexive_rewrite(b,A)| -reflexive_rewrite(c,A)|goal.
% 1.71/1.91 ** KEPT (pick-wt=6): 2 [] -e_qualish(A,B)|e_qualish(B,A).
% 1.71/1.91 ** KEPT (pick-wt=9): 3 [] -e_qualish(A,B)| -reflexive_rewrite(B,C)|reflexive_rewrite(A,C).
% 1.71/1.91 ** KEPT (pick-wt=6): 4 [] -e_qualish(A,B)|reflexive_rewrite(A,B).
% 1.71/1.91 ** KEPT (pick-wt=6): 5 [] -rewrite(A,B)|reflexive_rewrite(A,B).
% 1.71/1.91 ** KEPT (pick-wt=9): 6 [] -reflexive_rewrite(A,B)|e_qualish(A,B)|rewrite(A,B).
% 1.71/1.91 ** KEPT (pick-wt=12): 7 [] -rewrite(A,B)| -rewrite(A,C)|rewrite(B,$f1(A,B,C)).
% 1.71/1.91 ** KEPT (pick-wt=12): 8 [] -rewrite(A,B)| -rewrite(A,C)|rewrite(C,$f1(A,B,C)).
% 1.71/1.91 ** KEPT (pick-wt=1): 9 [] -goal.
% 1.71/1.91
% 1.71/1.91 ------------> process sos:
% 1.71/1.91 ** KEPT (pick-wt=3): 11 [] reflexive_rewrite(a,b).
% 1.71/1.91 ** KEPT (pick-wt=3): 12 [] reflexive_rewrite(a,c).
% 1.71/1.91 ** KEPT (pick-wt=3): 13 [] e_qualish(A,A).
% 1.71/1.91
% 1.71/1.91 ======= end of input processing =======
% 1.71/1.91
% 1.71/1.91 =========== start of search ===========
% 1.71/1.91
% 1.71/1.91 -------- PROOF --------
% 1.71/1.91
% 1.71/1.91 ----> UNIT CONFLICT at 0.00 sec ----> 84 [binary,83.1,9.1] $F.
% 1.71/1.91
% 1.71/1.91 Length of proof is 14. Level of proof is 10.
% 1.71/1.91
% 1.71/1.91 ---------------- PROOF ----------------
% 1.71/1.91 % SZS status Theorem
% 1.71/1.91 % SZS output start Refutation
% See solution above
% 1.71/1.91 ------------ end of proof -------------
% 1.71/1.91
% 1.71/1.91
% 1.71/1.91 Search stopped by max_proofs option.
% 1.71/1.91
% 1.71/1.91
% 1.71/1.91 Search stopped by max_proofs option.
% 1.71/1.91
% 1.71/1.91 ============ end of search ============
% 1.71/1.91
% 1.71/1.91 -------------- statistics -------------
% 1.71/1.91 clauses given 30
% 1.71/1.91 clauses generated 175
% 1.71/1.91 clauses kept 83
% 1.71/1.91 clauses forward subsumed 104
% 1.71/1.91 clauses back subsumed 55
% 1.71/1.91 Kbytes malloced 976
% 1.71/1.91
% 1.71/1.91 ----------- times (seconds) -----------
% 1.71/1.91 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.71/1.91 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.71/1.91 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.71/1.91
% 1.71/1.91 That finishes the proof of the theorem.
% 1.71/1.91
% 1.71/1.91 Process 16059 finished Wed Jul 27 06:50:53 2022
% 1.71/1.91 Otter interrupted
% 1.71/1.91 PROOF FOUND
%------------------------------------------------------------------------------