TSTP Solution File: SYN072-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN072-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n024.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:29 EDT 2022
% Result : Unsatisfiable 1.57s 1.80s
% Output : Refutation 1.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 10 unt; 5 nHn; 15 RR)
% Number of literals : 22 ( 11 equ; 5 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 : 1 ( 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(e),
file('SYN072-1.p',unknown),
[] ).
cnf(5,axiom,
( A = c
| A = d ),
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(c)
| e = d ),
inference(para_from,[status(thm),theory(equality)],[5,3]),
[iquote('para_from,5.1.1,3.1.1')] ).
cnf(9,plain,
( big_p(c)
| d = b ),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[5,7])]),
[iquote('para_from,5.1.1,7.1.1,flip.2')] ).
cnf(11,plain,
( big_p(c)
| d = a ),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[5,6])]),
[iquote('para_from,5.1.1,6.1.1,flip.2')] ).
cnf(13,plain,
( big_p(d)
| c = b ),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[5,7])]),
[iquote('para_from,5.2.1,7.1.1,flip.2')] ).
cnf(15,plain,
( big_p(d)
| c = a ),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[5,6])]),
[iquote('para_from,5.2.1,6.1.1,flip.2')] ).
cnf(19,plain,
big_p(c),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[11,9]),2])]),
[iquote('para_into,11.2.1,9.2.1,unit_del,2,factor_simp')] ).
cnf(21,plain,
e = d,
inference(hyper,[status(thm)],[19,8]),
[iquote('hyper,19,8')] ).
cnf(23,plain,
~ big_p(d),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[3]),21]),
[iquote('back_demod,3,demod,21')] ).
cnf(26,plain,
c = b,
inference(hyper,[status(thm)],[13,23]),
[iquote('hyper,13,23')] ).
cnf(27,plain,
$false,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[15]),26]),23,2]),
[iquote('back_demod,15,demod,26,unit_del,23,2')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN072-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 11:23:10 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.57/1.80 ----- Otter 3.3f, August 2004 -----
% 1.57/1.80 The process was started by sandbox on n024.cluster.edu,
% 1.57/1.80 Wed Jul 27 11:23:10 2022
% 1.57/1.80 The command was "./otter". The process ID is 24490.
% 1.57/1.80
% 1.57/1.80 set(prolog_style_variables).
% 1.57/1.80 set(auto).
% 1.57/1.80 dependent: set(auto1).
% 1.57/1.80 dependent: set(process_input).
% 1.57/1.80 dependent: clear(print_kept).
% 1.57/1.80 dependent: clear(print_new_demod).
% 1.57/1.80 dependent: clear(print_back_demod).
% 1.57/1.80 dependent: clear(print_back_sub).
% 1.57/1.80 dependent: set(control_memory).
% 1.57/1.80 dependent: assign(max_mem, 12000).
% 1.57/1.80 dependent: assign(pick_given_ratio, 4).
% 1.57/1.80 dependent: assign(stats_level, 1).
% 1.57/1.80 dependent: assign(max_seconds, 10800).
% 1.57/1.80 clear(print_given).
% 1.57/1.80
% 1.57/1.80 list(usable).
% 1.57/1.80 0 [] A=A.
% 1.57/1.80 0 [] X=c|X=d.
% 1.57/1.80 0 [] big_p(a).
% 1.57/1.80 0 [] big_p(b).
% 1.57/1.80 0 [] a!=b.
% 1.57/1.80 0 [] -big_p(e).
% 1.57/1.80 end_of_list.
% 1.57/1.80
% 1.57/1.80 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 1.57/1.80
% 1.57/1.80 This ia a non-Horn set with equality. The strategy will be
% 1.57/1.80 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.57/1.80 deletion, with positive clauses in sos and nonpositive
% 1.57/1.80 clauses in usable.
% 1.57/1.80
% 1.57/1.80 dependent: set(knuth_bendix).
% 1.57/1.80 dependent: set(anl_eq).
% 1.57/1.80 dependent: set(para_from).
% 1.57/1.80 dependent: set(para_into).
% 1.57/1.80 dependent: clear(para_from_right).
% 1.57/1.80 dependent: clear(para_into_right).
% 1.57/1.80 dependent: set(para_from_vars).
% 1.57/1.80 dependent: set(eq_units_both_ways).
% 1.57/1.80 dependent: set(dynamic_demod_all).
% 1.57/1.80 dependent: set(dynamic_demod).
% 1.57/1.80 dependent: set(order_eq).
% 1.57/1.80 dependent: set(back_demod).
% 1.57/1.80 dependent: set(lrpo).
% 1.57/1.80 dependent: set(hyper_res).
% 1.57/1.80 dependent: set(unit_deletion).
% 1.57/1.80 dependent: set(factor).
% 1.57/1.80
% 1.57/1.80 ------------> process usable:
% 1.57/1.80 ** KEPT (pick-wt=3): 2 [copy,1,flip.1] b!=a.
% 1.57/1.80 ** KEPT (pick-wt=2): 3 [] -big_p(e).
% 1.57/1.80
% 1.57/1.80 ------------> process sos:
% 1.57/1.80 ** KEPT (pick-wt=3): 4 [] A=A.
% 1.57/1.80 ** KEPT (pick-wt=6): 5 [] A=c|A=d.
% 1.57/1.80 ** KEPT (pick-wt=2): 6 [] big_p(a).
% 1.57/1.80 ** KEPT (pick-wt=2): 7 [] big_p(b).
% 1.57/1.80 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 1.57/1.80
% 1.57/1.80 ======= end of input processing =======
% 1.57/1.80
% 1.57/1.80 =========== start of search ===========
% 1.57/1.80
% 1.57/1.80 -------- PROOF --------
% 1.57/1.80
% 1.57/1.80 -----> EMPTY CLAUSE at 0.00 sec ----> 27 [back_demod,15,demod,26,unit_del,23,2] $F.
% 1.57/1.80
% 1.57/1.80 Length of proof is 10. Level of proof is 5.
% 1.57/1.80
% 1.57/1.80 ---------------- PROOF ----------------
% 1.57/1.80 % SZS status Unsatisfiable
% 1.57/1.80 % SZS output start Refutation
% See solution above
% 1.57/1.80 ------------ end of proof -------------
% 1.57/1.80
% 1.57/1.80
% 1.57/1.80 Search stopped by max_proofs option.
% 1.57/1.80
% 1.57/1.80
% 1.57/1.80 Search stopped by max_proofs option.
% 1.57/1.80
% 1.57/1.80 ============ end of search ============
% 1.57/1.80
% 1.57/1.80 -------------- statistics -------------
% 1.57/1.80 clauses given 14
% 1.57/1.80 clauses generated 53
% 1.57/1.80 clauses kept 23
% 1.57/1.80 clauses forward subsumed 43
% 1.57/1.80 clauses back subsumed 5
% 1.57/1.80 Kbytes malloced 976
% 1.57/1.80
% 1.57/1.80 ----------- times (seconds) -----------
% 1.57/1.80 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.57/1.80 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.57/1.80 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.57/1.80
% 1.57/1.80 That finishes the proof of the theorem.
% 1.57/1.80
% 1.57/1.80 Process 24490 finished Wed Jul 27 11:23:11 2022
% 1.57/1.80 Otter interrupted
% 1.57/1.80 PROOF FOUND
%------------------------------------------------------------------------------