TSTP Solution File: SYN071-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN071-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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.64s 1.87s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 7 unt; 5 nHn; 13 RR)
% Number of literals : 21 ( 20 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 1 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
a != d,
file('SYN071-1.p',unknown),
[] ).
cnf(2,plain,
d != a,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(3,axiom,
b != c,
file('SYN071-1.p',unknown),
[] ).
cnf(4,plain,
c != b,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[3])]),
[iquote('copy,3,flip.1')] ).
cnf(5,axiom,
A = A,
file('SYN071-1.p',unknown),
[] ).
cnf(6,axiom,
( a = b
| c = d ),
file('SYN071-1.p',unknown),
[] ).
cnf(7,plain,
( b = a
| d = c ),
inference(flip,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[6])])]),
[iquote('copy,6,flip.1,flip.2')] ).
cnf(8,axiom,
( a = c
| b = d ),
file('SYN071-1.p',unknown),
[] ).
cnf(9,plain,
( c = a
| d = b ),
inference(flip,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[8])])]),
[iquote('copy,8,flip.1,flip.2')] ).
cnf(10,plain,
( c != a
| b = a ),
inference(para_from,[status(thm),theory(equality)],[7,2]),
[iquote('para_from,7.2.1,2.1.1')] ).
cnf(11,plain,
( c = a
| b = a ),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[9,7]),4]),
[iquote('para_into,9.2.1,7.2.1,unit_del,4')] ).
cnf(12,plain,
( b != a
| d = b ),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[9,4])]),
[iquote('para_from,9.1.1,4.1.1,flip.1')] ).
cnf(16,plain,
b = a,
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[11,10])]),
[iquote('hyper,11,10,factor_simp')] ).
cnf(19,plain,
$false,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[12]),16,16]),5,2]),
[iquote('back_demod,12,demod,16,16,unit_del,5,2')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN071-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n012.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:22:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.64/1.87 ----- Otter 3.3f, August 2004 -----
% 1.64/1.87 The process was started by sandbox on n012.cluster.edu,
% 1.64/1.87 Wed Jul 27 11:22:50 2022
% 1.64/1.87 The command was "./otter". The process ID is 19931.
% 1.64/1.87
% 1.64/1.87 set(prolog_style_variables).
% 1.64/1.87 set(auto).
% 1.64/1.87 dependent: set(auto1).
% 1.64/1.87 dependent: set(process_input).
% 1.64/1.87 dependent: clear(print_kept).
% 1.64/1.87 dependent: clear(print_new_demod).
% 1.64/1.87 dependent: clear(print_back_demod).
% 1.64/1.87 dependent: clear(print_back_sub).
% 1.64/1.87 dependent: set(control_memory).
% 1.64/1.87 dependent: assign(max_mem, 12000).
% 1.64/1.87 dependent: assign(pick_given_ratio, 4).
% 1.64/1.87 dependent: assign(stats_level, 1).
% 1.64/1.87 dependent: assign(max_seconds, 10800).
% 1.64/1.87 clear(print_given).
% 1.64/1.87
% 1.64/1.87 list(usable).
% 1.64/1.87 0 [] A=A.
% 1.64/1.87 0 [] a=b|c=d.
% 1.64/1.87 0 [] a=c|b=d.
% 1.64/1.87 0 [] a!=d.
% 1.64/1.87 0 [] b!=c.
% 1.64/1.87 end_of_list.
% 1.64/1.87
% 1.64/1.87 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 1.64/1.87
% 1.64/1.87 This ia a non-Horn set with equality. The strategy will be
% 1.64/1.87 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.64/1.87 deletion, with positive clauses in sos and nonpositive
% 1.64/1.87 clauses in usable.
% 1.64/1.87
% 1.64/1.87 dependent: set(knuth_bendix).
% 1.64/1.87 dependent: set(anl_eq).
% 1.64/1.87 dependent: set(para_from).
% 1.64/1.87 dependent: set(para_into).
% 1.64/1.87 dependent: clear(para_from_right).
% 1.64/1.87 dependent: clear(para_into_right).
% 1.64/1.87 dependent: set(para_from_vars).
% 1.64/1.87 dependent: set(eq_units_both_ways).
% 1.64/1.87 dependent: set(dynamic_demod_all).
% 1.64/1.87 dependent: set(dynamic_demod).
% 1.64/1.87 dependent: set(order_eq).
% 1.64/1.87 dependent: set(back_demod).
% 1.64/1.87 dependent: set(lrpo).
% 1.64/1.87 dependent: set(hyper_res).
% 1.64/1.87 dependent: set(unit_deletion).
% 1.64/1.87 dependent: set(factor).
% 1.64/1.87
% 1.64/1.87 ------------> process usable:
% 1.64/1.87 ** KEPT (pick-wt=3): 2 [copy,1,flip.1] d!=a.
% 1.64/1.87 ** KEPT (pick-wt=3): 4 [copy,3,flip.1] c!=b.
% 1.64/1.87
% 1.64/1.87 ------------> process sos:
% 1.64/1.87 ** KEPT (pick-wt=3): 5 [] A=A.
% 1.64/1.87 ** KEPT (pick-wt=6): 7 [copy,6,flip.1,flip.2] b=a|d=c.
% 1.64/1.87 ** KEPT (pick-wt=6): 9 [copy,8,flip.1,flip.2] c=a|d=b.
% 1.64/1.87 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] A=A.
% 1.64/1.87
% 1.64/1.87 ======= end of input processing =======
% 1.64/1.87
% 1.64/1.87 =========== start of search ===========
% 1.64/1.87
% 1.64/1.87 -------- PROOF --------
% 1.64/1.87
% 1.64/1.87 -----> EMPTY CLAUSE at 0.00 sec ----> 19 [back_demod,12,demod,16,16,unit_del,5,2] $F.
% 1.64/1.87
% 1.64/1.87 Length of proof is 8. Level of proof is 3.
% 1.64/1.87
% 1.64/1.87 ---------------- PROOF ----------------
% 1.64/1.87 % SZS status Unsatisfiable
% 1.64/1.87 % SZS output start Refutation
% See solution above
% 1.64/1.87 ------------ end of proof -------------
% 1.64/1.87
% 1.64/1.87
% 1.64/1.87 Search stopped by max_proofs option.
% 1.64/1.87
% 1.64/1.87
% 1.64/1.87 Search stopped by max_proofs option.
% 1.64/1.87
% 1.64/1.87 ============ end of search ============
% 1.64/1.87
% 1.64/1.87 -------------- statistics -------------
% 1.64/1.87 clauses given 5
% 1.64/1.87 clauses generated 20
% 1.64/1.87 clauses kept 12
% 1.64/1.87 clauses forward subsumed 16
% 1.64/1.87 clauses back subsumed 0
% 1.64/1.87 Kbytes malloced 976
% 1.64/1.87
% 1.64/1.87 ----------- times (seconds) -----------
% 1.64/1.87 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.64/1.87 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.64/1.87 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.64/1.87
% 1.64/1.87 That finishes the proof of the theorem.
% 1.64/1.87
% 1.64/1.87 Process 19931 finished Wed Jul 27 11:22:52 2022
% 1.64/1.87 Otter interrupted
% 1.64/1.87 PROOF FOUND
%------------------------------------------------------------------------------