TSTP Solution File: ALG240-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : ALG240-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %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 : 600s
% DateTime : Thu Jul 14 15:38:49 EDT 2022
% Result : Unsatisfiable 1.62s 2.03s
% Output : Refutation 1.62s
% Verified :
% SZS Type : ERROR: Analysing output (Cycle in a tree)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(mult(A,B),mult(A,C)),mult(A,mult(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(2,plain,
equal(mult(mult(A,B),C),mult(mult(A,C),mult(B,C))),
file('ALG240-1.p',unknown),
[] ).
cnf(3,plain,
equal(mult(mult(A,B),mult(C,B)),mult(mult(A,C),B)),
inference(flip,[status(thm),theory(equality)],[2]),
[iquote('flip(2)')] ).
cnf(4,plain,
equal(mult(mult(mult(A,B),mult(C,D)),mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D)))),mult(mult(A,C),mult(B,D))),
file('ALG240-1.p',unknown),
[] ).
cnf(5,plain,
equal(mult(mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D))),mult(mult(A,C),mult(B,D))),mult(mult(A,B),mult(C,D))),
file('ALG240-1.p',unknown),
[] ).
cnf(6,plain,
~ equal(mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d))),mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d)))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(7,plain,
equal(mult(mult(A,mult(B,C)),mult(mult(A,B),D)),mult(mult(A,B),mult(mult(A,C),D))),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(18,plain,
equal(mult(mult(A,A),B),mult(A,mult(B,B))),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(19,plain,
equal(mult(A,mult(B,B)),mult(mult(A,A),B)),
inference(flip,[status(thm),theory(equality)],[18]),
[iquote('flip(18)')] ).
cnf(26,plain,
equal(mult(mult(A,mult(B,C)),mult(C,mult(B,C))),mult(mult(A,B),C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,2]),1]),
[iquote('para(3,2),flip(1)')] ).
cnf(43,plain,
equal(mult(A,mult(A,mult(B,B))),mult(A,mult(A,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,18]),1]),1]),
[iquote('para(1,18),demod([1]),flip(1)')] ).
cnf(57,plain,
equal(mult(mult(A,B),A),mult(A,mult(B,mult(A,A)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,18]),1]),
[iquote('para(3,18),demod([1])')] ).
cnf(69,plain,
equal(mult(mult(A,B),mult(mult(A,A),C)),mult(A,mult(B,mult(C,C)))),
inference(para,[status(thm),theory(equality)],[19,1]),
[iquote('para(19,1)')] ).
cnf(70,plain,
equal(mult(A,mult(B,mult(C,C))),mult(mult(A,B),mult(mult(A,A),C))),
inference(flip,[status(thm),theory(equality)],[69]),
[iquote('flip(69)')] ).
cnf(71,plain,
equal(mult(A,mult(mult(B,B),mult(A,A))),mult(A,mult(B,A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,1]),1,57]),
[iquote('para(19,1),demod([1,57])')] ).
cnf(74,plain,
equal(mult(mult(mult(A,B),mult(C,D)),mult(mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D))),E)),mult(mult(mult(A,C),mult(B,D)),mult(mult(mult(A,B),mult(C,D)),E))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,1]),1]),
[iquote('para(4,1),flip(1)')] ).
cnf(75,plain,
equal(mult(mult(mult(mult(A,B),mult(C,D)),E),mult(mult(A,C),mult(B,D))),mult(mult(mult(A,B),mult(C,D)),mult(E,mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D)))))),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(76,plain,
equal(mult(mult(mult(A,B),mult(C,D)),mult(mult(mult(A,C),mult(B,D)),mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D))))),mult(mult(A,B),mult(C,D))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[5]),75]),
[iquote('back_demod(5),demod([75])')] ).
cnf(111,plain,
equal(mult(mult(mult(A,A),B),A),mult(A,mult(B,A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,57]),71]),
[iquote('para(19,57),demod([71])')] ).
cnf(133,plain,
equal(mult(mult(mult(A,mult(A,A)),B),A),mult(A,mult(mult(B,B),A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,111]),1]),
[iquote('para(19,111),demod([1])')] ).
cnf(134,plain,
equal(mult(A,mult(mult(B,B),A)),mult(mult(mult(A,mult(A,A)),B),A)),
inference(flip,[status(thm),theory(equality)],[133]),
[iquote('flip(133)')] ).
cnf(163,plain,
equal(mult(mult(mult(A,B),C),A),mult(mult(A,mult(B,mult(A,A))),mult(C,A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[57,3]),1]),
[iquote('para(57,3),flip(1)')] ).
cnf(164,plain,
equal(mult(A,mult(mult(B,B),A)),mult(mult(A,mult(A,A)),mult(B,A))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[134]),163,1,43]),
[iquote('back_demod(134),demod([163,1,43])')] ).
cnf(165,plain,
equal(mult(mult(A,mult(A,A)),mult(B,A)),mult(A,mult(mult(B,B),A))),
inference(flip,[status(thm),theory(equality)],[164]),
[iquote('flip(164)')] ).
cnf(166,plain,
equal(mult(mult(A,mult(A,A)),mult(B,A)),mult(A,mult(B,A))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[111]),163,43]),
[iquote('back_demod(111),demod([163,43])')] ).
cnf(167,plain,
equal(mult(A,mult(mult(B,B),A)),mult(A,mult(B,A))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[165]),166]),1]),
[iquote('back_demod(165),demod([166]),flip(1)')] ).
cnf(176,plain,
equal(mult(A,mult(B,mult(A,A))),mult(A,mult(B,A))),
inference(para,[status(thm),theory(equality)],[18,167]),
[iquote('para(18,167)')] ).
cnf(182,plain,
equal(mult(mult(A,B),A),mult(A,mult(B,A))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[57]),176]),
[iquote('back_demod(57),demod([176])')] ).
cnf(184,plain,
equal(mult(mult(A,B),mult(mult(A,A),C)),mult(A,mult(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[182,1]),7,1]),
[iquote('para(182,1),demod([7,1])')] ).
cnf(185,plain,
equal(mult(A,mult(B,mult(C,C))),mult(A,mult(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[70]),184]),
[iquote('back_demod(70),demod([184])')] ).
cnf(2458,plain,
equal(mult(mult(mult(A,B),mult(C,D)),mult(mult(mult(A,B),mult(C,D)),mult(mult(mult(A,C),mult(B,D)),mult(mult(A,B),mult(C,D))))),mult(mult(mult(A,C),mult(B,D)),mult(mult(A,B),mult(C,D)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,26]),1,1,185]),
[iquote('para(4,26),demod([1,1,185])')] ).
cnf(5639,plain,
equal(mult(mult(mult(A,B),mult(C,D)),mult(mult(mult(A,C),mult(B,D)),mult(mult(A,B),mult(C,D)))),mult(mult(A,C),mult(B,D))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[75,74]),76,1,1,185]),1]),
[iquote('para(75,74),demod([76,1,1,185]),flip(1)')] ).
cnf(5644,plain,
equal(mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D))),mult(mult(mult(A,C),mult(B,D)),mult(mult(A,B),mult(C,D)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[2458]),5639]),
[iquote('back_demod(2458),demod([5639])')] ).
cnf(5645,plain,
$false,
inference(conflict,[status(thm)],[5644,6]),
[iquote('conflict(5644,6)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : ALG240-1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %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 : 600
% 0.12/0.33 % DateTime : Thu Jun 9 04:24:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.62/2.03 ----- EQP 0.9e, May 2009 -----
% 1.62/2.03 The job began on n018.cluster.edu, Thu Jun 9 04:24:53 2022
% 1.62/2.03 The command was "./eqp09e".
% 1.62/2.03
% 1.62/2.03 set(prolog_style_variables).
% 1.62/2.03 set(lrpo).
% 1.62/2.03 set(basic_paramod).
% 1.62/2.03 set(functional_subsume).
% 1.62/2.03 set(ordered_paramod).
% 1.62/2.03 set(prime_paramod).
% 1.62/2.03 set(para_pairs).
% 1.62/2.03 assign(pick_given_ratio,4).
% 1.62/2.03 clear(print_kept).
% 1.62/2.03 clear(print_new_demod).
% 1.62/2.03 clear(print_back_demod).
% 1.62/2.03 clear(print_given).
% 1.62/2.03 assign(max_mem,64000).
% 1.62/2.03 end_of_commands.
% 1.62/2.03
% 1.62/2.03 Usable:
% 1.62/2.03 end_of_list.
% 1.62/2.03
% 1.62/2.03 Sos:
% 1.62/2.03 0 (wt=-1) [] mult(A,mult(B,C)) = mult(mult(A,B),mult(A,C)).
% 1.62/2.03 0 (wt=-1) [] mult(mult(A,B),C) = mult(mult(A,C),mult(B,C)).
% 1.62/2.03 0 (wt=-1) [] mult(mult(mult(A,B),mult(C,D)),mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D)))) = mult(mult(A,C),mult(B,D)).
% 1.62/2.03 0 (wt=-1) [] mult(mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D))),mult(mult(A,C),mult(B,D))) = mult(mult(A,B),mult(C,D)).
% 1.62/2.03 0 (wt=-1) [] -(mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d))) = mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d)))).
% 1.62/2.03 end_of_list.
% 1.62/2.03
% 1.62/2.03 Demodulators:
% 1.62/2.03 end_of_list.
% 1.62/2.03
% 1.62/2.03 Passive:
% 1.62/2.03 end_of_list.
% 1.62/2.03
% 1.62/2.03 Starting to process input.
% 1.62/2.03
% 1.62/2.03 ** KEPT: 1 (wt=13) [flip(1)] mult(mult(A,B),mult(A,C)) = mult(A,mult(B,C)).
% 1.62/2.03 1 is a new demodulator.
% 1.62/2.03
% 1.62/2.03 ** KEPT: 2 (wt=13) [] mult(mult(A,B),C) = mult(mult(A,C),mult(B,C)).
% 1.62/2.03
% 1.62/2.03 ** KEPT: 3 (wt=13) [flip(2)] mult(mult(A,B),mult(C,B)) = mult(mult(A,C),B).
% 1.62/2.03 clause forward subsumed: 0 (wt=13) [flip(3)] mult(mult(A,C),B) = mult(mult(A,B),mult(C,B)).
% 1.62/2.03
% 1.62/2.03 ** KEPT: 4 (wt=31) [] mult(mult(mult(A,B),mult(C,D)),mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D)))) = mult(mult(A,C),mult(B,D)).
% 1.62/2.03 4 is a new demodulator.
% 1.62/2.03
% 1.62/2.03 ** KEPT: 5 (wt=31) [] mult(mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D))),mult(mult(A,C),mult(B,D))) = mult(mult(A,B),mult(C,D)).
% 1.62/2.03 5 is a new demodulator.
% 1.62/2.03
% 1.62/2.03 ** KEPT: 6 (wt=31) [flip(1)] -(mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d))) = mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d)))).
% 1.62/2.03 ---------------- PROOF FOUND ----------------
% 1.62/2.03 % SZS status Unsatisfiable
% 1.62/2.03
% 1.62/2.03
% 1.62/2.03 After processing input:
% 1.62/2.03
% 1.62/2.03 Usable:
% 1.62/2.03 end_of_list.
% 1.62/2.03
% 1.62/2.03 Sos:
% 1.62/2.03 1 (wt=13) [flip(1)] mult(mult(A,B),mult(A,C)) = mult(A,mult(B,C)).
% 1.62/2.03 2 (wt=13) [] mult(mult(A,B),C) = mult(mult(A,C),mult(B,C)).
% 1.62/2.03 3 (wt=13) [flip(2)] mult(mult(A,B),mult(C,B)) = mult(mult(A,C),B).
% 1.62/2.03 4 (wt=31) [] mult(mult(mult(A,B),mult(C,D)),mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D)))) = mult(mult(A,C),mult(B,D)).
% 1.62/2.03 5 (wt=31) [] mult(mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D))),mult(mult(A,C),mult(B,D))) = mult(mult(A,B),mult(C,D)).
% 1.62/2.03 6 (wt=31) [flip(1)] -(mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d))) = mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d)))).
% 1.62/2.03 end_of_list.
% 1.62/2.03
% 1.62/2.03 Demodulators:
% 1.62/2.03 1 (wt=13) [flip(1)] mult(mult(A,B),mult(A,C)) = mult(A,mult(B,C)).
% 1.62/2.03 4 (wt=31) [] mult(mult(mult(A,B),mult(C,D)),mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D)))) = mult(mult(A,C),mult(B,D)).
% 1.62/2.03 5 (wt=31) [] mult(mult(mult(mult(A,B),mult(C,D)),mult(mult(A,C),mult(B,D))),mult(mult(A,C),mult(B,D))) = mult(mult(A,B),mult(C,D)).
% 1.62/2.03 end_of_list.
% 1.62/2.03
% 1.62/2.03 Passive:
% 1.62/2.03 end_of_list.
% 1.62/2.03
% 1.62/2.03 UNIT CONFLICT from 5644 and 6 at 0.77 seconds.
% 1.62/2.03
% 1.62/2.03 ---------------- PROOF ----------------
% 1.62/2.03 % SZS output start Refutation
% See solution above
% 1.62/2.03 ------------ end of proof -------------
% 1.62/2.03
% 1.62/2.03
% 1.62/2.03 ------------- memory usage ------------
% 1.62/2.03 Memory dynamically allocated (tp_alloc): 13183.
% 1.62/2.03 type (bytes each) gets frees in use avail bytes
% 1.62/2.03 sym_ent ( 96) 57 0 57 0 5.3 K
% 1.62/2.03 term ( 16) 755448 557844 197604 48 3838.3 K
% 1.62/2.03 gen_ptr ( 8) 946091 79994 866097 50 6766.8 K
% 1.62/2.03 context ( 808) 362405 362403 2 5 5.5 K
% 1.62/2.03 trail ( 12) 574406 574406 0 7 0.1 K
% 1.62/2.03 bt_node ( 68) 58003 57992 11 14 1.7 K
% 1.62/2.03 ac_position (285432) 0 0 0 0 0.0 K
% 1.62/2.03 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.62/2.03 ac_match_free_vars_pos (4020)
% 1.62/2.03 0 0 0 0 0.0 K
% 1.62/2.03 discrim ( 12) 134766 10581 124185 124 1456.7 K
% 1.62/2.03 flat ( 40) 2090021 2090021 0 89 3.5 K
% 1.62/2.03 discrim_pos ( 12) 27382 27382 0 1 0.0 K
% 1.62/2.03 fpa_head ( 12) 1310 0 1310 0 15.4 K
% 1.62/2.03 fpa_tree ( 28) 29284 29284 0 87 2.4 K
% 1.62/2.03 fpa_pos ( 36) 7370 7370 0 1 0.0 K
% 1.62/2.03 literal ( 12) 27326 21682 5644 1 66.2 K
% 1.62/2.03 clause ( 24) 27326 21682 5644 1 132.3 K
% 1.62/2.03 list ( 12) 1785 1728 57 4 0.7 K
% 1.62/2.03 list_pos ( 20) 19858 2589 17269 10 337.5 K
% 1.62/2.03 pair_index ( 40) 2 0 2 0 0.1 K
% 1.62/2.03
% 1.62/2.03 -------------- statistics -------------
% 1.62/2.03 Clauses input 5
% 1.62/2.03 Usable input 0
% 1.62/2.03 Sos input 5
% 1.62/2.03 Demodulators input 0
% 1.62/2.03 Passive input 0
% 1.62/2.03
% 1.62/2.03 Processed BS (before search) 7
% 1.62/2.03 Forward subsumed BS 1
% 1.62/2.03 Kept BS 6
% 1.62/2.03 New demodulators BS 3
% 1.62/2.03 Back demodulated BS 0
% 1.62/2.03
% 1.62/2.03 Clauses or pairs given 2410
% 1.62/2.03 Clauses generated 14892
% 1.62/2.03 Forward subsumed 9254
% 1.62/2.03 Deleted by weight 0
% 1.62/2.03 Deleted by variable count 0
% 1.62/2.03 Kept 5638
% 1.62/2.03 New demodulators 1723
% 1.62/2.03 Back demodulated 581
% 1.62/2.03 Ordered paramod prunes 0
% 1.62/2.03 Basic paramod prunes 3594
% 1.62/2.03 Prime paramod prunes 489
% 1.62/2.03 Semantic prunes 0
% 1.62/2.03
% 1.62/2.03 Rewrite attmepts 281909
% 1.62/2.03 Rewrites 21312
% 1.62/2.03
% 1.62/2.03 FPA overloads 0
% 1.62/2.03 FPA underloads 0
% 1.62/2.03
% 1.62/2.03 Usable size 0
% 1.62/2.03 Sos size 5062
% 1.62/2.03 Demodulators size 1501
% 1.62/2.03 Passive size 0
% 1.62/2.03 Disabled size 581
% 1.62/2.03
% 1.62/2.03 Proofs found 1
% 1.62/2.03
% 1.62/2.03 ----------- times (seconds) ----------- Thu Jun 9 04:24:54 2022
% 1.62/2.03
% 1.62/2.03 user CPU time 0.77 (0 hr, 0 min, 0 sec)
% 1.62/2.03 system CPU time 0.20 (0 hr, 0 min, 0 sec)
% 1.62/2.03 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.62/2.03 input time 0.00
% 1.62/2.03 paramodulation time 0.05
% 1.62/2.03 demodulation time 0.10
% 1.62/2.03 orient time 0.05
% 1.62/2.03 weigh time 0.01
% 1.62/2.03 forward subsume time 0.06
% 1.62/2.03 back demod find time 0.21
% 1.62/2.03 conflict time 0.01
% 1.62/2.03 LRPO time 0.02
% 1.62/2.03 store clause time 0.20
% 1.62/2.03 disable clause time 0.01
% 1.62/2.03 prime paramod time 0.02
% 1.62/2.03 semantics time 0.00
% 1.62/2.03
% 1.62/2.03 EQP interrupted
%------------------------------------------------------------------------------