TSTP Solution File: RNG128-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : RNG128-1 : TPTP v8.1.0. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n004.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:12:21 EDT 2022
% Result : Unsatisfiable 1.73s 1.94s
% Output : Refutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 8 RR)
% Number of literals : 48 ( 47 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
add(x0,x1) != mult(x0,x1),
file('RNG128-1.p',unknown),
[] ).
cnf(2,plain,
mult(x0,x1) != add(x0,x1),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(4,axiom,
add(A,add(B,C)) = add(add(A,B),C),
file('RNG128-1.p',unknown),
[] ).
cnf(6,plain,
add(add(A,B),C) = add(A,add(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[4])]),
[iquote('copy,4,flip.1')] ).
cnf(7,axiom,
add(A,B) = add(B,A),
file('RNG128-1.p',unknown),
[] ).
cnf(8,axiom,
mult(A,B) = mult(B,A),
file('RNG128-1.p',unknown),
[] ).
cnf(10,axiom,
mult(A,add(B,C)) = add(mult(A,B),mult(A,C)),
file('RNG128-1.p',unknown),
[] ).
cnf(12,axiom,
add(zero,A) = A,
file('RNG128-1.p',unknown),
[] ).
cnf(14,axiom,
mult(A,unit) = A,
file('RNG128-1.p',unknown),
[] ).
cnf(15,axiom,
add(unit,add(A,mult(A,A))) = A,
file('RNG128-1.p',unknown),
[] ).
cnf(18,plain,
add(A,zero) = A,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[7,12])]),
[iquote('para_into,7.1.1,11.1.1,flip.1')] ).
cnf(19,plain,
add(A,add(B,C)) = add(B,add(A,C)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[6,7]),6]),
[iquote('para_into,5.1.1.1,7.1.1,demod,6')] ).
cnf(22,plain,
mult(unit,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[8,14])]),
[iquote('para_into,8.1.1,13.1.1,flip.1')] ).
cnf(25,plain,
add(unit,add(unit,unit)) = unit,
inference(para_into,[status(thm),theory(equality)],[15,22]),
[iquote('para_into,15.1.1.2.2,22.1.1')] ).
cnf(28,plain,
add(unit,mult(zero,zero)) = zero,
inference(para_into,[status(thm),theory(equality)],[15,12]),
[iquote('para_into,15.1.1.2,11.1.1')] ).
cnf(29,plain,
add(unit,add(mult(A,A),A)) = A,
inference(para_into,[status(thm),theory(equality)],[15,7]),
[iquote('para_into,15.1.1.2,7.1.1')] ).
cnf(38,plain,
add(mult(A,B),mult(A,zero)) = mult(A,B),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[10,18])]),
[iquote('para_into,9.1.1.2,17.1.1,flip.1')] ).
cnf(41,plain,
add(mult(A,zero),mult(A,B)) = mult(A,B),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[10,12])]),
[iquote('para_into,9.1.1.2,11.1.1,flip.1')] ).
cnf(43,plain,
mult(add(A,B),C) = add(mult(C,A),mult(C,B)),
inference(para_into,[status(thm),theory(equality)],[10,8]),
[iquote('para_into,9.1.1,8.1.1')] ).
cnf(44,plain,
add(mult(A,B),mult(A,C)) = mult(add(B,C),A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[43])]),
[iquote('copy,43,flip.1')] ).
cnf(47,plain,
add(A,add(A,A)) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[25,10]),14,14,10,14,14])]),
[iquote('para_from,25.1.1,9.1.1.2,demod,14,14,10,14,14,flip.1')] ).
cnf(49,plain,
add(mult(zero,zero),unit) = zero,
inference(para_into,[status(thm),theory(equality)],[28,7]),
[iquote('para_into,27.1.1,7.1.1')] ).
cnf(51,plain,
add(unit,add(mult(zero,zero),A)) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[28,6]),12])]),
[iquote('para_from,27.1.1,5.1.1.1,demod,12,flip.1')] ).
cnf(61,plain,
add(mult(A,mult(zero,zero)),A) = mult(A,zero),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[49,10]),14])]),
[iquote('para_from,49.1.1,9.1.1.2,demod,14,flip.1')] ).
cnf(65,plain,
add(A,add(B,add(A,A))) = add(B,A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[19,47])]),
[iquote('para_into,19.1.1.2,47.1.1,flip.1')] ).
cnf(78,plain,
add(unit,add(mult(add(A,B),A),add(mult(add(A,B),B),add(A,B)))) = add(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[29,10]),6]),
[iquote('para_into,29.1.1.2.1,9.1.1,demod,6')] ).
cnf(84,plain,
add(mult(A,A),add(A,unit)) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[29,7]),6]),
[iquote('para_into,29.1.1,7.1.1,demod,6')] ).
cnf(101,plain,
mult(zero,zero) = zero,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[51,47]),28,38])]),
[iquote('para_into,51.1.1.2,47.1.1,demod,28,38,flip.1')] ).
cnf(103,plain,
add(unit,add(A,B)) = add(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[51,19]),101,12]),
[iquote('para_into,51.1.1.2,19.1.1,demod,101,12')] ).
cnf(105,plain,
zero = unit,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[51,18]),101,18])]),
[iquote('para_into,51.1.1.2,17.1.1,demod,101,18,flip.1')] ).
cnf(107,plain,
add(A,unit) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[51,7]),105,105,14,103]),
[iquote('para_into,51.1.1.2,7.1.1,demod,105,105,14,103')] ).
cnf(109,plain,
add(unit,A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[51,19]),105,105,14,103]),
[iquote('para_into,51.1.1,19.1.1,demod,105,105,14,103')] ).
cnf(111,plain,
add(A,A) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[61]),105,105,14,14,105,14]),
[iquote('back_demod,61,demod,105,105,14,14,105,14')] ).
cnf(118,plain,
add(mult(add(A,B),A),add(mult(add(A,B),B),add(A,B))) = add(A,B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[78]),109]),
[iquote('back_demod,78,demod,109')] ).
cnf(127,plain,
add(A,mult(A,B)) = mult(A,B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[41]),105,14]),
[iquote('back_demod,41,demod,105,14')] ).
cnf(129,plain,
add(mult(A,B),A) = mult(A,B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[38]),105,14]),
[iquote('back_demod,37,demod,105,14')] ).
cnf(132,plain,
mult(A,A) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[84]),107,129]),
[iquote('back_demod,84,demod,107,129')] ).
cnf(138,plain,
add(A,add(B,A)) = add(B,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[65]),111]),
[iquote('back_demod,65,demod,111')] ).
cnf(140,plain,
add(mult(add(A,B),A),mult(add(A,B),B)) = add(A,B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[118]),129]),
[iquote('back_demod,118,demod,129')] ).
cnf(155,plain,
add(A,mult(B,A)) = mult(A,B),
inference(para_into,[status(thm),theory(equality)],[127,8]),
[iquote('para_into,126.1.1.2,8.1.1')] ).
cnf(158,plain,
mult(A,B) = add(A,mult(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[155])]),
[iquote('copy,155,flip.1')] ).
cnf(197,plain,
add(mult(A,B),mult(B,A)) = add(B,mult(A,B)),
inference(para_from,[status(thm),theory(equality)],[155,138]),
[iquote('para_from,155.1.1,138.1.1.2')] ).
cnf(215,plain,
add(A,mult(B,A)) = mult(B,A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[158,8])]),
[iquote('para_into,158.1.1,8.1.1,flip.1')] ).
cnf(217,plain,
add(mult(A,B),mult(B,A)) = mult(A,B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[197]),215]),
[iquote('back_demod,197,demod,215')] ).
cnf(251,plain,
mult(add(A,B),A) = mult(A,B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[44,132]),127])]),
[iquote('para_into,44.1.1.1,132.1.1,demod,127,flip.1')] ).
cnf(255,plain,
mult(add(A,B),B) = mult(B,A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[44,132]),129])]),
[iquote('para_into,44.1.1.2,132.1.1,demod,129,flip.1')] ).
cnf(258,plain,
mult(A,B) = add(A,B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[140]),251,255,217]),
[iquote('back_demod,140,demod,251,255,217')] ).
cnf(260,plain,
$false,
inference(binary,[status(thm)],[258,2]),
[iquote('binary,258.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG128-1 : TPTP v8.1.0. Released v5.4.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n004.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 02:06:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.73/1.94 ----- Otter 3.3f, August 2004 -----
% 1.73/1.94 The process was started by sandbox2 on n004.cluster.edu,
% 1.73/1.94 Wed Jul 27 02:06:06 2022
% 1.73/1.94 The command was "./otter". The process ID is 13921.
% 1.73/1.94
% 1.73/1.94 set(prolog_style_variables).
% 1.73/1.94 set(auto).
% 1.73/1.94 dependent: set(auto1).
% 1.73/1.94 dependent: set(process_input).
% 1.73/1.94 dependent: clear(print_kept).
% 1.73/1.94 dependent: clear(print_new_demod).
% 1.73/1.94 dependent: clear(print_back_demod).
% 1.73/1.94 dependent: clear(print_back_sub).
% 1.73/1.94 dependent: set(control_memory).
% 1.73/1.94 dependent: assign(max_mem, 12000).
% 1.73/1.94 dependent: assign(pick_given_ratio, 4).
% 1.73/1.94 dependent: assign(stats_level, 1).
% 1.73/1.94 dependent: assign(max_seconds, 10800).
% 1.73/1.94 clear(print_given).
% 1.73/1.94
% 1.73/1.94 list(usable).
% 1.73/1.94 0 [] A=A.
% 1.73/1.94 0 [] add(A,add(B,C))=add(add(A,B),C).
% 1.73/1.94 0 [] add(A,B)=add(B,A).
% 1.73/1.94 0 [] mult(A,B)=mult(B,A).
% 1.73/1.94 0 [] mult(A,add(B,C))=add(mult(A,B),mult(A,C)).
% 1.73/1.94 0 [] add(zero,A)=A.
% 1.73/1.94 0 [] mult(A,unit)=A.
% 1.73/1.94 0 [] add(unit,add(A,mult(A,A)))=A.
% 1.73/1.94 0 [] add(x0,x1)!=mult(x0,x1).
% 1.73/1.94 end_of_list.
% 1.73/1.94
% 1.73/1.94 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.73/1.94
% 1.73/1.94 All clauses are units, and equality is present; the
% 1.73/1.94 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.73/1.94
% 1.73/1.94 dependent: set(knuth_bendix).
% 1.73/1.94 dependent: set(anl_eq).
% 1.73/1.94 dependent: set(para_from).
% 1.73/1.94 dependent: set(para_into).
% 1.73/1.94 dependent: clear(para_from_right).
% 1.73/1.94 dependent: clear(para_into_right).
% 1.73/1.94 dependent: set(para_from_vars).
% 1.73/1.94 dependent: set(eq_units_both_ways).
% 1.73/1.94 dependent: set(dynamic_demod_all).
% 1.73/1.94 dependent: set(dynamic_demod).
% 1.73/1.94 dependent: set(order_eq).
% 1.73/1.94 dependent: set(back_demod).
% 1.73/1.94 dependent: set(lrpo).
% 1.73/1.94
% 1.73/1.94 ------------> process usable:
% 1.73/1.94 ** KEPT (pick-wt=7): 2 [copy,1,flip.1] mult(x0,x1)!=add(x0,x1).
% 1.73/1.94
% 1.73/1.94 ------------> process sos:
% 1.73/1.94 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.73/1.94 ** KEPT (pick-wt=11): 5 [copy,4,flip.1] add(add(A,B),C)=add(A,add(B,C)).
% 1.73/1.94 ---> New Demodulator: 6 [new_demod,5] add(add(A,B),C)=add(A,add(B,C)).
% 1.73/1.94 ** KEPT (pick-wt=7): 7 [] add(A,B)=add(B,A).
% 1.73/1.94 ** KEPT (pick-wt=7): 8 [] mult(A,B)=mult(B,A).
% 1.73/1.94 ** KEPT (pick-wt=13): 9 [] mult(A,add(B,C))=add(mult(A,B),mult(A,C)).
% 1.73/1.94 ---> New Demodulator: 10 [new_demod,9] mult(A,add(B,C))=add(mult(A,B),mult(A,C)).
% 1.73/1.94 ** KEPT (pick-wt=5): 11 [] add(zero,A)=A.
% 1.73/1.94 ---> New Demodulator: 12 [new_demod,11] add(zero,A)=A.
% 1.73/1.94 ** KEPT (pick-wt=5): 13 [] mult(A,unit)=A.
% 1.73/1.94 ---> New Demodulator: 14 [new_demod,13] mult(A,unit)=A.
% 1.73/1.94 ** KEPT (pick-wt=9): 15 [] add(unit,add(A,mult(A,A)))=A.
% 1.73/1.94 ---> New Demodulator: 16 [new_demod,15] add(unit,add(A,mult(A,A)))=A.
% 1.73/1.94 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.73/1.94 >>>> Starting back demodulation with 6.
% 1.73/1.94 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] add(A,B)=add(B,A).
% 1.73/1.94 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] mult(A,B)=mult(B,A).
% 1.73/1.94 >>>> Starting back demodulation with 10.
% 1.73/1.94 >>>> Starting back demodulation with 12.
% 1.73/1.94 >>>> Starting back demodulation with 14.
% 1.73/1.94 >>>> Starting back demodulation with 16.
% 1.73/1.94
% 1.73/1.94 ======= end of input processing =======
% 1.73/1.94
% 1.73/1.94 =========== start of search ===========
% 1.73/1.94
% 1.73/1.94 -------- PROOF --------
% 1.73/1.94
% 1.73/1.94 ----> UNIT CONFLICT at 0.01 sec ----> 260 [binary,258.1,2.1] $F.
% 1.73/1.94
% 1.73/1.94 Length of proof is 39. Level of proof is 11.
% 1.73/1.94
% 1.73/1.94 ---------------- PROOF ----------------
% 1.73/1.94 % SZS status Unsatisfiable
% 1.73/1.94 % SZS output start Refutation
% See solution above
% 1.73/1.94 ------------ end of proof -------------
% 1.73/1.94
% 1.73/1.94
% 1.73/1.94 Search stopped by max_proofs option.
% 1.73/1.94
% 1.73/1.94
% 1.73/1.94 Search stopped by max_proofs option.
% 1.73/1.94
% 1.73/1.94 ============ end of search ============
% 1.73/1.94
% 1.73/1.94 -------------- statistics -------------
% 1.73/1.94 clauses given 36
% 1.73/1.94 clauses generated 495
% 1.73/1.94 clauses kept 172
% 1.73/1.94 clauses forward subsumed 489
% 1.73/1.94 clauses back subsumed 0
% 1.73/1.94 Kbytes malloced 976
% 1.73/1.94
% 1.73/1.94 ----------- times (seconds) -----------
% 1.73/1.94 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.73/1.94 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.73/1.94 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.73/1.94
% 1.73/1.94 That finishes the proof of the theorem.
% 1.73/1.94
% 1.73/1.94 Process 13921 finished Wed Jul 27 02:06:08 2022
% 1.73/1.94 Otter interrupted
% 1.73/1.94 PROOF FOUND
%------------------------------------------------------------------------------