%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN072+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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:23:30 EDT 2022
% Result : Theorem 1.69s 1.91s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 22 ( 11 unt; 6 nHn; 20 RR)
% Number of literals : 33 ( 20 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
a != b,
file('SYN072+1.p',unknown),
[] ).
cnf(2,plain,
b != a,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(3,axiom,
~ big_p(dollar_c3),
file('SYN072+1.p',unknown),
[] ).
cnf(4,axiom,
A = A,
file('SYN072+1.p',unknown),
[] ).
cnf(5,axiom,
( A = dollar_c2
| A = dollar_c1 ),
file('SYN072+1.p',unknown),
[] ).
cnf(6,axiom,
big_p(a),
file('SYN072+1.p',unknown),
[] ).
cnf(7,axiom,
big_p(b),
file('SYN072+1.p',unknown),
[] ).
cnf(8,plain,
( ~ big_p(dollar_c2)
| dollar_c3 = dollar_c1 ),
inference(para_from,[status(thm),theory(equality)],[5,3]),
[iquote('para_from,5.1.1,3.1.1')] ).
cnf(9,plain,
( big_p(dollar_c2)
| b = dollar_c1 ),
inference(para_from,[status(thm),theory(equality)],[5,7]),
[iquote('para_from,5.1.1,7.1.1')] ).
cnf(10,plain,
( a != dollar_c2
| b = dollar_c1 ),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[5,2])]),
[iquote('para_from,5.1.1,2.1.1,flip.1')] ).
cnf(11,plain,
( big_p(dollar_c2)
| a = dollar_c1 ),
inference(para_from,[status(thm),theory(equality)],[5,6]),
[iquote('para_from,5.1.1,6.1.1')] ).
cnf(13,plain,
( big_p(dollar_c1)
| b = dollar_c2 ),
inference(para_from,[status(thm),theory(equality)],[5,7]),
[iquote('para_from,5.2.1,7.1.1')] ).
cnf(15,plain,
( big_p(dollar_c1)
| a = dollar_c2 ),
inference(para_from,[status(thm),theory(equality)],[5,6]),
[iquote('para_from,5.2.1,6.1.1')] ).
cnf(16,plain,
( ~ big_p(dollar_c1)
| ~ big_p(dollar_c2) ),
inference(para_from,[status(thm),theory(equality)],[8,3]),
[iquote('para_from,8.2.1,3.1.1')] ).
cnf(19,plain,
( a != dollar_c1
| big_p(dollar_c2) ),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[9,2])]),
[iquote('para_from,9.2.1,2.1.1,flip.1')] ).
cnf(23,plain,
( b = dollar_c1
| a = dollar_c1 ),
inference(hyper,[status(thm)],[10,5]),
[iquote('hyper,10,5')] ).
cnf(26,plain,
( a != dollar_c1
| a != dollar_c2 ),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[10,2])]),
[iquote('para_from,10.2.1,2.1.1,flip.1')] ).
cnf(33,plain,
big_p(dollar_c2),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[19,11]),4])]),
[iquote('para_into,19.1.1,11.2.1,unit_del,4,factor_simp')] ).
cnf(35,plain,
a = dollar_c2,
inference(hyper,[status(thm)],[33,16,15]),
[iquote('hyper,33,16,15')] ).
cnf(37,plain,
b = dollar_c2,
inference(hyper,[status(thm)],[33,16,13]),
[iquote('hyper,33,16,13')] ).
cnf(40,plain,
dollar_c2 != dollar_c1,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[26]),35,35]),4]),
[iquote('back_demod,26,demod,35,35,unit_del,4')] ).
cnf(42,plain,
$false,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[23]),37,35]),40,40]),
[iquote('back_demod,23,demod,37,35,unit_del,40,40')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN072+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n018.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 11:20:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.69/1.91 ----- Otter 3.3f, August 2004 -----
% 1.69/1.91 The process was started by sandbox2 on n018.cluster.edu,
% 1.69/1.91 Wed Jul 27 11:20:01 2022
% 1.69/1.91 The command was "./otter". The process ID is 30032.
% 1.69/1.91
% 1.69/1.91 set(prolog_style_variables).
% 1.69/1.91 set(auto).
% 1.69/1.91 dependent: set(auto1).
% 1.69/1.91 dependent: set(process_input).
% 1.69/1.91 dependent: clear(print_kept).
% 1.69/1.91 dependent: clear(print_new_demod).
% 1.69/1.91 dependent: clear(print_back_demod).
% 1.69/1.91 dependent: clear(print_back_sub).
% 1.69/1.91 dependent: set(control_memory).
% 1.69/1.91 dependent: assign(max_mem, 12000).
% 1.69/1.91 dependent: assign(pick_given_ratio, 4).
% 1.69/1.91 dependent: assign(stats_level, 1).
% 1.69/1.91 dependent: assign(max_seconds, 10800).
% 1.69/1.91 clear(print_given).
% 1.69/1.91
% 1.69/1.91 formula_list(usable).
% 1.69/1.91 all A (A=A).
% 1.69/1.91 exists X Y all Z (Z=X|Z=Y).
% 1.69/1.91 big_p(a).
% 1.69/1.91 big_p(b).
% 1.69/1.91 a!=b.
% 1.69/1.91 -(all X big_p(X)).
% 1.69/1.91 end_of_list.
% 1.69/1.91
% 1.69/1.91 -------> usable clausifies to:
% 1.69/1.91
% 1.69/1.91 list(usable).
% 1.69/1.91 0 [] A=A.
% 1.69/1.91 0 [] Z=$c2|Z=$c1.
% 1.69/1.91 0 [] big_p(a).
% 1.69/1.91 0 [] big_p(b).
% 1.69/1.91 0 [] a!=b.
% 1.69/1.91 0 [] -big_p($c3).
% 1.69/1.91 end_of_list.
% 1.69/1.91
% 1.69/1.91 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 1.69/1.91
% 1.69/1.91 This ia a non-Horn set with equality. The strategy will be
% 1.69/1.91 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.69/1.91 deletion, with positive clauses in sos and nonpositive
% 1.69/1.91 clauses in usable.
% 1.69/1.91
% 1.69/1.91 dependent: set(knuth_bendix).
% 1.69/1.91 dependent: set(anl_eq).
% 1.69/1.91 dependent: set(para_from).
% 1.69/1.91 dependent: set(para_into).
% 1.69/1.91 dependent: clear(para_from_right).
% 1.69/1.91 dependent: clear(para_into_right).
% 1.69/1.91 dependent: set(para_from_vars).
% 1.69/1.91 dependent: set(eq_units_both_ways).
% 1.69/1.91 dependent: set(dynamic_demod_all).
% 1.69/1.91 dependent: set(dynamic_demod).
% 1.69/1.91 dependent: set(order_eq).
% 1.69/1.91 dependent: set(back_demod).
% 1.69/1.91 dependent: set(lrpo).
% 1.69/1.91 dependent: set(hyper_res).
% 1.69/1.91 dependent: set(unit_deletion).
% 1.69/1.91 dependent: set(factor).
% 1.69/1.91
% 1.69/1.91 ------------> process usable:
% 1.69/1.91 ** KEPT (pick-wt=3): 2 [copy,1,flip.1] b!=a.
% 1.69/1.91 ** KEPT (pick-wt=2): 3 [] -big_p($c3).
% 1.69/1.91
% 1.69/1.91 ------------> process sos:
% 1.69/1.91 ** KEPT (pick-wt=3): 4 [] A=A.
% 1.69/1.91 ** KEPT (pick-wt=6): 5 [] A=$c2|A=$c1.
% 1.69/1.91 ** KEPT (pick-wt=2): 6 [] big_p(a).
% 1.69/1.91 ** KEPT (pick-wt=2): 7 [] big_p(b).
% 1.69/1.91 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 1.69/1.91
% 1.69/1.91 ======= end of input processing =======
% 1.69/1.91
% 1.69/1.91 =========== start of search ===========
% 1.69/1.91
% 1.69/1.91 -------- PROOF --------
% 1.69/1.91
% 1.69/1.91 -----> EMPTY CLAUSE at 0.00 sec ----> 42 [back_demod,23,demod,37,35,unit_del,40,40] $F.
% 1.69/1.91
% 1.69/1.91 Length of proof is 15. Level of proof is 5.
% 1.69/1.91
% 1.69/1.91 ---------------- PROOF ----------------
% 1.69/1.91 % SZS status Theorem
% 1.69/1.91 % SZS output start Refutation
% See solution above
% 1.69/1.91 ------------ end of proof -------------
% 1.69/1.91
% 1.69/1.91
% 1.69/1.91 Search stopped by max_proofs option.
% 1.69/1.91
% 1.69/1.91
% 1.69/1.91 Search stopped by max_proofs option.
% 1.69/1.91
% 1.69/1.91 ============ end of search ============
% 1.69/1.91
% 1.69/1.91 -------------- statistics -------------
% 1.69/1.91 clauses given 15
% 1.69/1.91 clauses generated 107
% 1.69/1.91 clauses kept 37
% 1.69/1.91 clauses forward subsumed 82
% 1.69/1.91 clauses back subsumed 7
% 1.69/1.91 Kbytes malloced 976
% 1.69/1.91
% 1.69/1.91 ----------- times (seconds) -----------
% 1.69/1.91 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.69/1.91 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.69/1.91 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.69/1.91
% 1.69/1.91 That finishes the proof of the theorem.
% 1.69/1.91
% 1.69/1.91 Process 30032 finished Wed Jul 27 11:20:03 2022
% 1.69/1.91 Otter interrupted
% 1.69/1.91 PROOF FOUND
%------------------------------------------------------------------------------