TSTP Solution File: RNG128-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG128-1 : TPTP v8.1.0. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n019.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 : 600s
% DateTime : Mon Jul 18 20:25:44 EDT 2022
% Result : Unsatisfiable 0.70s 1.10s
% Output : Refutation 0.70s
% Verified :
% SZS Type : ERROR: Analysing output (Cycle in a tree)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(add(A,B),C),add(A,add(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(2,plain,
equal(add(A,B),add(B,A)),
file('RNG128-1.p',unknown),
[] ).
cnf(3,plain,
equal(mult(A,B),mult(B,A)),
file('RNG128-1.p',unknown),
[] ).
cnf(4,plain,
equal(mult(A,add(B,C)),add(mult(A,B),mult(A,C))),
file('RNG128-1.p',unknown),
[] ).
cnf(5,plain,
equal(add(zero,A),A),
file('RNG128-1.p',unknown),
[] ).
cnf(6,plain,
equal(mult(A,unit),A),
file('RNG128-1.p',unknown),
[] ).
cnf(7,plain,
equal(add(unit,add(A,mult(A,A))),A),
file('RNG128-1.p',unknown),
[] ).
cnf(8,plain,
~ equal(mult(x0,x1),add(x0,x1)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(9,plain,
equal(add(A,zero),A),
inference(para,[status(thm),theory(equality)],[2,5]),
[iquote('para(2,5)')] ).
cnf(14,plain,
equal(add(unit,mult(zero,zero)),zero),
inference(para,[status(thm),theory(equality)],[5,7]),
[iquote('para(5,7)')] ).
cnf(15,plain,
equal(add(mult(zero,zero),unit),zero),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,2]),1]),
[iquote('para(14,2),flip(1)')] ).
cnf(16,plain,
equal(add(mult(A,B),mult(A,C)),mult(add(B,C),A)),
inference(para,[status(thm),theory(equality)],[4,3]),
[iquote('para(4,3)')] ).
cnf(18,plain,
equal(add(mult(A,zero),mult(A,B)),mult(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,4]),1]),
[iquote('para(5,4),flip(1)')] ).
cnf(21,plain,
equal(add(unit,add(mult(A,A),A)),A),
inference(para,[status(thm),theory(equality)],[2,7]),
[iquote('para(2,7)')] ).
cnf(25,plain,
equal(add(mult(A,A),add(A,unit)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[21,2]),1]),1]),
[iquote('para(21,2),demod([1]),flip(1)')] ).
cnf(28,plain,
equal(add(mult(A,B),mult(A,zero)),mult(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,4]),1]),
[iquote('para(9,4),flip(1)')] ).
cnf(35,plain,
equal(add(mult(A,zero),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,18]),6]),
[iquote('para(6,18),demod([6])')] ).
cnf(36,plain,
equal(mult(zero,zero),zero),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[35,9]),1]),
[iquote('para(35,9),flip(1)')] ).
cnf(37,plain,
equal(zero,unit),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[15]),36,5]),1]),
[iquote('back_demod(15),demod([36,5]),flip(1)')] ).
cnf(38,plain,
equal(add(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[35]),37,6]),
[iquote('back_demod(35),demod([37,6])')] ).
cnf(39,plain,
equal(add(mult(A,B),A),mult(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[28]),37,6]),
[iquote('back_demod(28),demod([37,6])')] ).
cnf(41,plain,
equal(add(A,mult(A,B)),mult(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[18]),37,6]),
[iquote('back_demod(18),demod([37,6])')] ).
cnf(43,plain,
equal(add(A,unit),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[9]),37]),
[iquote('back_demod(9),demod([37])')] ).
cnf(44,plain,
equal(mult(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[25]),43,39]),
[iquote('back_demod(25),demod([43,39])')] ).
cnf(105,plain,
equal(add(mult(add(A,B),A),mult(add(A,B),B)),add(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[44,4]),1]),
[iquote('para(44,4),flip(1)')] ).
cnf(106,plain,
equal(mult(add(A,B),A),mult(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[44,16]),41]),1]),
[iquote('para(44,16),demod([41]),flip(1)')] ).
cnf(107,plain,
equal(add(mult(A,B),mult(add(A,B),B)),add(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[105]),106]),
[iquote('back_demod(105),demod([106])')] ).
cnf(108,plain,
equal(mult(add(A,B),B),mult(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[44,16]),39]),1]),
[iquote('para(44,16),demod([39]),flip(1)')] ).
cnf(109,plain,
equal(add(mult(A,B),mult(B,A)),add(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[107]),108]),
[iquote('back_demod(107),demod([108])')] ).
cnf(120,plain,
equal(mult(A,B),add(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,109]),38]),
[iquote('para(3,109),demod([38])')] ).
cnf(135,plain,
~ equal(add(x1,x0),add(x0,x1)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[8]),120]),
[iquote('back_demod(8),demod([120])')] ).
cnf(136,plain,
$false,
inference(conflict,[status(thm)],[135,2]),
[iquote('conflict(135,2)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG128-1 : TPTP v8.1.0. Released v5.4.0.
% 0.03/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon May 30 10:06:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.70/1.10 ----- EQP 0.9e, May 2009 -----
% 0.70/1.10 The job began on n019.cluster.edu, Mon May 30 10:06:56 2022
% 0.70/1.10 The command was "./eqp09e".
% 0.70/1.10
% 0.70/1.10 set(prolog_style_variables).
% 0.70/1.10 set(lrpo).
% 0.70/1.10 set(basic_paramod).
% 0.70/1.10 set(functional_subsume).
% 0.70/1.10 set(ordered_paramod).
% 0.70/1.10 set(prime_paramod).
% 0.70/1.10 set(para_pairs).
% 0.70/1.10 assign(pick_given_ratio,4).
% 0.70/1.10 clear(print_kept).
% 0.70/1.10 clear(print_new_demod).
% 0.70/1.10 clear(print_back_demod).
% 0.70/1.10 clear(print_given).
% 0.70/1.10 assign(max_mem,64000).
% 0.70/1.10 end_of_commands.
% 0.70/1.10
% 0.70/1.10 Usable:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Sos:
% 0.70/1.10 0 (wt=-1) [] add(A,add(B,C)) = add(add(A,B),C).
% 0.70/1.10 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.70/1.10 0 (wt=-1) [] mult(A,B) = mult(B,A).
% 0.70/1.10 0 (wt=-1) [] mult(A,add(B,C)) = add(mult(A,B),mult(A,C)).
% 0.70/1.10 0 (wt=-1) [] add(zero,A) = A.
% 0.70/1.10 0 (wt=-1) [] mult(A,unit) = A.
% 0.70/1.10 0 (wt=-1) [] add(unit,add(A,mult(A,A))) = A.
% 0.70/1.10 0 (wt=-1) [] -(add(x0,x1) = mult(x0,x1)).
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Demodulators:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Passive:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Starting to process input.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 1 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.70/1.10 1 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 2 (wt=7) [] add(A,B) = add(B,A).
% 0.70/1.10 clause forward subsumed: 0 (wt=7) [flip(2)] add(B,A) = add(A,B).
% 0.70/1.10
% 0.70/1.10 ** KEPT: 3 (wt=7) [] mult(A,B) = mult(B,A).
% 0.70/1.10 clause forward subsumed: 0 (wt=7) [flip(3)] mult(B,A) = mult(A,B).
% 0.70/1.10
% 0.70/1.10 ** KEPT: 4 (wt=13) [] mult(A,add(B,C)) = add(mult(A,B),mult(A,C)).
% 0.70/1.10 4 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 5 (wt=5) [] add(zero,A) = A.
% 0.70/1.10 5 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 6 (wt=5) [] mult(A,unit) = A.
% 0.70/1.10 6 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 7 (wt=9) [] add(unit,add(A,mult(A,A))) = A.
% 0.70/1.10 7 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 8 (wt=7) [flip(1)] -(mult(x0,x1) = add(x0,x1)).
% 0.70/1.10 ---------------- PROOF FOUND ----------------
% 0.70/1.10 % SZS status Unsatisfiable
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 After processing input:
% 0.70/1.10
% 0.70/1.10 Usable:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Sos:
% 0.70/1.10 5 (wt=5) [] add(zero,A) = A.
% 0.70/1.10 6 (wt=5) [] mult(A,unit) = A.
% 0.70/1.10 2 (wt=7) [] add(A,B) = add(B,A).
% 0.70/1.10 3 (wt=7) [] mult(A,B) = mult(B,A).
% 0.70/1.10 8 (wt=7) [flip(1)] -(mult(x0,x1) = add(x0,x1)).
% 0.70/1.10 7 (wt=9) [] add(unit,add(A,mult(A,A))) = A.
% 0.70/1.10 1 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.70/1.10 4 (wt=13) [] mult(A,add(B,C)) = add(mult(A,B),mult(A,C)).
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Demodulators:
% 0.70/1.10 1 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.70/1.10 4 (wt=13) [] mult(A,add(B,C)) = add(mult(A,B),mult(A,C)).
% 0.70/1.10 5 (wt=5) [] add(zero,A) = A.
% 0.70/1.10 6 (wt=5) [] mult(A,unit) = A.
% 0.70/1.10 7 (wt=9) [] add(unit,add(A,mult(A,A))) = A.
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Passive:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 UNIT CONFLICT from 135 and 2 at 0.01 seconds.
% 0.70/1.10
% 0.70/1.10 ---------------- PROOF ----------------
% 0.70/1.10 % SZS output start Refutation
% See solution above
% 0.70/1.10 ------------ end of proof -------------
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 ------------- memory usage ------------
% 0.70/1.10 Memory dynamically allocated (tp_alloc): 488.
% 0.70/1.10 type (bytes each) gets frees in use avail bytes
% 0.70/1.10 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.70/1.10 term ( 16) 11373 9476 1897 20 36.9 K
% 0.70/1.10 gen_ptr ( 8) 10177 3497 6680 35 52.5 K
% 0.70/1.10 context ( 808) 7251 7249 2 4 4.7 K
% 0.70/1.10 trail ( 12) 1516 1516 0 4 0.0 K
% 0.70/1.10 bt_node ( 68) 2358 2355 3 4 0.5 K
% 0.70/1.10 ac_position (285432) 0 0 0 0 0.0 K
% 0.70/1.10 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.70/1.10 ac_match_free_vars_pos (4020)
% 0.70/1.10 0 0 0 0 0.0 K
% 0.70/1.10 discrim ( 12) 989 656 333 298 7.4 K
% 0.70/1.10 flat ( 40) 18071 18071 0 25 1.0 K
% 0.70/1.10 discrim_pos ( 12) 841 841 0 1 0.0 K
% 0.70/1.10 fpa_head ( 12) 303 0 303 0 3.6 K
% 0.70/1.10 fpa_tree ( 28) 140 140 0 9 0.2 K
% 0.70/1.10 fpa_pos ( 36) 185 185 0 1 0.0 K
% 0.70/1.10 literal ( 12) 795 660 135 1 1.6 K
% 0.70/1.10 clause ( 24) 795 660 135 1 3.2 K
% 0.70/1.10 list ( 12) 109 52 57 5 0.7 K
% 0.70/1.10 list_pos ( 20) 621 356 265 94 7.0 K
% 0.70/1.10 pair_index ( 40) 2 0 2 0 0.1 K
% 0.70/1.10
% 0.70/1.10 -------------- statistics -------------
% 0.70/1.10 Clauses input 8
% 0.70/1.10 Usable input 0
% 0.70/1.10 Sos input 8
% 0.70/1.10 Demodulators input 0
% 0.70/1.10 Passive input 0
% 0.70/1.10
% 0.70/1.10 Processed BS (before search) 10
% 0.70/1.10 Forward subsumed BS 2
% 0.70/1.10 Kept BS 8
% 0.70/1.10 New demodulators BS 5
% 0.70/1.10 Back demodulated BS 0
% 0.70/1.10
% 0.70/1.10 Clauses or pairs given 512
% 0.70/1.10 Clauses generated 482
% 0.70/1.10 Forward subsumed 355
% 0.70/1.10 Deleted by weight 0
% 0.70/1.10 Deleted by variable count 0
% 0.70/1.10 Kept 127
% 0.70/1.10 New demodulators 45
% 0.70/1.10 Back demodulated 76
% 0.70/1.10 Ordered paramod prunes 0
% 0.70/1.10 Basic paramod prunes 465
% 0.70/1.10 Prime paramod prunes 14
% 0.70/1.10 Semantic prunes 0
% 0.70/1.10
% 0.70/1.10 Rewrite attmepts 3752
% 0.70/1.10 Rewrites 672
% 0.70/1.10
% 0.70/1.10 FPA overloads 0
% 0.70/1.10 FPA underloads 0
% 0.70/1.10
% 0.70/1.10 Usable size 0
% 0.70/1.10 Sos size 58
% 0.70/1.10 Demodulators size 12
% 0.70/1.10 Passive size 0
% 0.70/1.10 Disabled size 76
% 0.70/1.10
% 0.70/1.10 Proofs found 1
% 0.70/1.10
% 0.70/1.10 ----------- times (seconds) ----------- Mon May 30 10:06:56 2022
% 0.70/1.10
% 0.70/1.10 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.70/1.10 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.70/1.10 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.70/1.10 input time 0.00
% 0.70/1.10 paramodulation time 0.00
% 0.70/1.10 demodulation time 0.00
% 0.70/1.10 orient time 0.00
% 0.70/1.10 weigh time 0.00
% 0.70/1.10 forward subsume time 0.00
% 0.70/1.10 back demod find time 0.00
% 0.70/1.10 conflict time 0.00
% 0.70/1.10 LRPO time 0.00
% 0.70/1.10 store clause time 0.00
% 0.70/1.10 disable clause time 0.00
% 0.70/1.10 prime paramod time 0.00
% 0.70/1.10 semantics time 0.00
% 0.70/1.10
% 0.70/1.10 EQP interrupted
%------------------------------------------------------------------------------