TSTP Solution File: ALG245-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : ALG245-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n021.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:50 EDT 2022
% Result : Unsatisfiable 2.05s 2.46s
% Output : Refutation 2.05s
% 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(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('ALG245-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('ALG245-1.p',unknown),
[] ).
cnf(6,plain,
equal(mult(A,A),A),
file('ALG245-1.p',unknown),
[] ).
cnf(7,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(8,plain,
equal(mult(mult(A,B),A),mult(A,mult(B,A))),
inference(para,[status(thm),theory(equality)],[6,1]),
[iquote('para(6,1)')] ).
cnf(51,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(52,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(53,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]),52]),
[iquote('back_demod(5),demod([52])')] ).
cnf(148,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(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,8]),8]),1]),
[iquote('para(4,8),demod([8]),flip(1)')] ).
cnf(7139,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)],[52,51]),53,6]),1]),
[iquote('para(52,51),demod([53,6]),flip(1)')] ).
cnf(7149,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)],[148]),7139]),
[iquote('back_demod(148),demod([7139])')] ).
cnf(7150,plain,
$false,
inference(conflict,[status(thm)],[7149,7]),
[iquote('conflict(7149,7)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ALG245-1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 8 08:42:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.05/2.46 ----- EQP 0.9e, May 2009 -----
% 2.05/2.46 The job began on n021.cluster.edu, Wed Jun 8 08:42:23 2022
% 2.05/2.46 The command was "./eqp09e".
% 2.05/2.46
% 2.05/2.46 set(prolog_style_variables).
% 2.05/2.46 set(lrpo).
% 2.05/2.46 set(basic_paramod).
% 2.05/2.46 set(functional_subsume).
% 2.05/2.46 set(ordered_paramod).
% 2.05/2.46 set(prime_paramod).
% 2.05/2.46 set(para_pairs).
% 2.05/2.46 assign(pick_given_ratio,4).
% 2.05/2.46 clear(print_kept).
% 2.05/2.46 clear(print_new_demod).
% 2.05/2.46 clear(print_back_demod).
% 2.05/2.46 clear(print_given).
% 2.05/2.46 assign(max_mem,64000).
% 2.05/2.46 end_of_commands.
% 2.05/2.46
% 2.05/2.46 Usable:
% 2.05/2.46 end_of_list.
% 2.05/2.46
% 2.05/2.46 Sos:
% 2.05/2.46 0 (wt=-1) [] mult(A,mult(B,C)) = mult(mult(A,B),mult(A,C)).
% 2.05/2.46 0 (wt=-1) [] mult(mult(A,B),C) = mult(mult(A,C),mult(B,C)).
% 2.05/2.46 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)).
% 2.05/2.46 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)).
% 2.05/2.46 0 (wt=-1) [] mult(A,A) = A.
% 2.05/2.46 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)))).
% 2.05/2.46 end_of_list.
% 2.05/2.46
% 2.05/2.46 Demodulators:
% 2.05/2.46 end_of_list.
% 2.05/2.46
% 2.05/2.46 Passive:
% 2.05/2.46 end_of_list.
% 2.05/2.46
% 2.05/2.46 Starting to process input.
% 2.05/2.46
% 2.05/2.46 ** KEPT: 1 (wt=13) [flip(1)] mult(mult(A,B),mult(A,C)) = mult(A,mult(B,C)).
% 2.05/2.46 1 is a new demodulator.
% 2.05/2.46
% 2.05/2.46 ** KEPT: 2 (wt=13) [] mult(mult(A,B),C) = mult(mult(A,C),mult(B,C)).
% 2.05/2.46
% 2.05/2.46 ** KEPT: 3 (wt=13) [flip(2)] mult(mult(A,B),mult(C,B)) = mult(mult(A,C),B).
% 2.05/2.46 clause forward subsumed: 0 (wt=13) [flip(3)] mult(mult(A,C),B) = mult(mult(A,B),mult(C,B)).
% 2.05/2.46
% 2.05/2.46 ** 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)).
% 2.05/2.46 4 is a new demodulator.
% 2.05/2.46
% 2.05/2.46 ** 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)).
% 2.05/2.46 5 is a new demodulator.
% 2.05/2.46
% 2.05/2.46 ** KEPT: 6 (wt=5) [] mult(A,A) = A.
% 2.05/2.46 6 is a new demodulator.
% 2.05/2.46
% 2.05/2.46 ** KEPT: 7 (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)))).
% 2.05/2.46 ---------------- PROOF FOUND ----------------
% 2.05/2.46 % SZS status Unsatisfiable
% 2.05/2.46
% 2.05/2.46
% 2.05/2.46 After processing input:
% 2.05/2.46
% 2.05/2.46 Usable:
% 2.05/2.46 end_of_list.
% 2.05/2.46
% 2.05/2.46 Sos:
% 2.05/2.46 6 (wt=5) [] mult(A,A) = A.
% 2.05/2.46 1 (wt=13) [flip(1)] mult(mult(A,B),mult(A,C)) = mult(A,mult(B,C)).
% 2.05/2.46 2 (wt=13) [] mult(mult(A,B),C) = mult(mult(A,C),mult(B,C)).
% 2.05/2.46 3 (wt=13) [flip(2)] mult(mult(A,B),mult(C,B)) = mult(mult(A,C),B).
% 2.05/2.46 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)).
% 2.05/2.46 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)).
% 2.05/2.46 7 (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)))).
% 2.05/2.46 end_of_list.
% 2.05/2.46
% 2.05/2.46 Demodulators:
% 2.05/2.46 1 (wt=13) [flip(1)] mult(mult(A,B),mult(A,C)) = mult(A,mult(B,C)).
% 2.05/2.46 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)).
% 2.05/2.46 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)).
% 2.05/2.46 6 (wt=5) [] mult(A,A) = A.
% 2.05/2.46 end_of_list.
% 2.05/2.46
% 2.05/2.46 Passive:
% 2.05/2.46 end_of_list.
% 2.05/2.46
% 2.05/2.46 UNIT CONFLICT from 7149 and 7 at 1.21 seconds.
% 2.05/2.46
% 2.05/2.46 ---------------- PROOF ----------------
% 2.05/2.46 % SZS output start Refutation
% See solution above
% 2.05/2.46 ------------ end of proof -------------
% 2.05/2.46
% 2.05/2.46
% 2.05/2.46 ------------- memory usage ------------
% 2.05/2.46 Memory dynamically allocated (tp_alloc): 17089.
% 2.05/2.46 type (bytes each) gets frees in use avail bytes
% 2.05/2.46 sym_ent ( 96) 57 0 57 0 5.3 K
% 2.05/2.46 term ( 16) 850151 591356 258795 48 5027.6 K
% 2.05/2.46 gen_ptr ( 8) 1240618 92158 1148460 50 8972.7 K
% 2.05/2.46 context ( 808) 415273 415271 2 5 5.5 K
% 2.05/2.46 trail ( 12) 766788 766788 0 7 0.1 K
% 2.05/2.46 bt_node ( 68) 67474 67463 11 14 1.7 K
% 2.05/2.46 ac_position (285432) 0 0 0 0 0.0 K
% 2.05/2.46 ac_match_pos (14044) 0 0 0 0 0.0 K
% 2.05/2.46 ac_match_free_vars_pos (4020)
% 2.05/2.46 0 0 0 0 0.0 K
% 2.05/2.46 discrim ( 12) 183008 18947 164061 197 1924.9 K
% 2.05/2.46 flat ( 40) 2453762 2453762 0 89 3.5 K
% 2.05/2.46 discrim_pos ( 12) 26869 26869 0 1 0.0 K
% 2.05/2.46 fpa_head ( 12) 1363 0 1363 0 16.0 K
% 2.05/2.46 fpa_tree ( 28) 37372 37372 0 89 2.4 K
% 2.05/2.46 fpa_pos ( 36) 9586 9586 0 1 0.0 K
% 2.05/2.46 literal ( 12) 30923 23774 7149 1 83.8 K
% 2.05/2.46 clause ( 24) 30923 23774 7149 1 167.6 K
% 2.05/2.46 list ( 12) 2496 2439 57 2 0.7 K
% 2.05/2.46 list_pos ( 20) 25269 3129 22140 11 432.6 K
% 2.05/2.46 pair_index ( 40) 2 0 2 0 0.1 K
% 2.05/2.46
% 2.05/2.46 -------------- statistics -------------
% 2.05/2.46 Clauses input 6
% 2.05/2.46 Usable input 0
% 2.05/2.46 Sos input 6
% 2.05/2.46 Demodulators input 0
% 2.05/2.46 Passive input 0
% 2.05/2.46
% 2.05/2.46 Processed BS (before search) 8
% 2.05/2.46 Forward subsumed BS 1
% 2.05/2.46 Kept BS 7
% 2.05/2.46 New demodulators BS 4
% 2.05/2.46 Back demodulated BS 0
% 2.05/2.46
% 2.05/2.46 Clauses or pairs given 3305
% 2.05/2.46 Clauses generated 16731
% 2.05/2.46 Forward subsumed 9589
% 2.05/2.46 Deleted by weight 0
% 2.05/2.46 Deleted by variable count 0
% 2.05/2.46 Kept 7142
% 2.05/2.46 New demodulators 2433
% 2.05/2.46 Back demodulated 688
% 2.05/2.46 Ordered paramod prunes 0
% 2.05/2.46 Basic paramod prunes 6693
% 2.05/2.46 Prime paramod prunes 295
% 2.05/2.46 Semantic prunes 0
% 2.05/2.46
% 2.05/2.46 Rewrite attmepts 321975
% 2.05/2.46 Rewrites 20955
% 2.05/2.46
% 2.05/2.46 FPA overloads 0
% 2.05/2.46 FPA underloads 0
% 2.05/2.46
% 2.05/2.46 Usable size 0
% 2.05/2.46 Sos size 6460
% 2.05/2.46 Demodulators size 2071
% 2.05/2.46 Passive size 0
% 2.05/2.46 Disabled size 688
% 2.05/2.46
% 2.05/2.46 Proofs found 1
% 2.05/2.46
% 2.05/2.46 ----------- times (seconds) ----------- Wed Jun 8 08:42:24 2022
% 2.05/2.46
% 2.05/2.46 user CPU time 1.21 (0 hr, 0 min, 1 sec)
% 2.05/2.46 system CPU time 0.19 (0 hr, 0 min, 0 sec)
% 2.05/2.46 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.05/2.46 input time 0.00
% 2.05/2.46 paramodulation time 0.05
% 2.05/2.46 demodulation time 0.14
% 2.05/2.46 orient time 0.05
% 2.05/2.46 weigh time 0.01
% 2.05/2.46 forward subsume time 0.07
% 2.05/2.46 back demod find time 0.40
% 2.05/2.46 conflict time 0.01
% 2.05/2.46 LRPO time 0.03
% 2.05/2.46 store clause time 0.34
% 2.05/2.46 disable clause time 0.03
% 2.05/2.46 prime paramod time 0.02
% 2.05/2.46 semantics time 0.00
% 2.05/2.46
% 2.05/2.46 EQP interrupted
%------------------------------------------------------------------------------