TSTP Solution File: BOO002-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n023.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 23:37:02 EDT 2022
% Result : Unsatisfiable 0.70s 1.18s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of clauses : 30 ( 30 unt; 0 nHn; 2 RR)
% Number of literals : 30 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 104 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(multiply(A,B,C),D,multiply(A,B,E)),multiply(A,B,multiply(C,D,E))),
file('BOO002-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B,B),B),
file('BOO002-1.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(A,A,B),A),
file('BOO002-1.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(inverse(A),A,B),B),
file('BOO002-1.p',unknown),
[] ).
cnf(5,plain,
~ equal(multiply(a,inverse(a),b),b),
file('BOO002-1.p',unknown),
[] ).
cnf(6,plain,
equal(multiply(multiply(A,B,multiply(C,D,E)),F,multiply(multiply(A,B,C),D,G)),multiply(multiply(A,B,C),D,multiply(multiply(A,B,E),F,G))),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(7,plain,
equal(multiply(multiply(multiply(A,B,C),D,E),F,multiply(A,B,multiply(C,D,G))),multiply(multiply(A,B,C),D,multiply(E,F,multiply(A,B,G)))),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(8,plain,
equal(multiply(A,B,multiply(C,A,D)),multiply(C,A,multiply(A,B,D))),
inference(para,[status(thm),theory(equality)],[2,1]),
[iquote('para(2,1)')] ).
cnf(9,plain,
equal(multiply(A,B,multiply(B,C,D)),multiply(B,C,multiply(A,B,D))),
inference(flip,[status(thm),theory(equality)],[8]),
[iquote('flip(8)')] ).
cnf(10,plain,
equal(multiply(multiply(A,B,C),D,B),multiply(A,B,multiply(C,D,B))),
inference(para,[status(thm),theory(equality)],[2,1]),
[iquote('para(2,1)')] ).
cnf(13,plain,
equal(multiply(A,B,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,1]),3,3]),
[iquote('para(3,1),demod([3,3])')] ).
cnf(14,plain,
equal(multiply(A,B,multiply(C,multiply(A,B,C),D)),multiply(A,B,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,1]),1]),
[iquote('para(3,1),flip(1)')] ).
cnf(15,plain,
equal(multiply(A,B,multiply(B,C,A)),multiply(B,C,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,8]),1]),
[iquote('para(13,8),flip(1)')] ).
cnf(21,plain,
equal(multiply(A,B,multiply(C,A,B)),multiply(C,A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,9]),1]),
[iquote('para(2,9),flip(1)')] ).
cnf(25,plain,
equal(multiply(multiply(A,B,multiply(C,D,E)),F,D),multiply(multiply(A,B,C),D,multiply(multiply(A,B,E),F,D))),
inference(para,[status(thm),theory(equality)],[2,6]),
[iquote('para(2,6)')] ).
cnf(31,plain,
equal(multiply(A,B,multiply(A,C,B)),multiply(A,C,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,10]),1]),
[iquote('para(13,10),flip(1)')] ).
cnf(47,plain,
equal(multiply(multiply(A,B,C),D,A),multiply(A,B,multiply(C,D,A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,7]),3,3,3]),
[iquote('para(3,7),demod([3,3,3])')] ).
cnf(98,plain,
equal(multiply(A,multiply(B,C,A),multiply(D,B,multiply(B,C,A))),multiply(B,C,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,15]),10,14]),
[iquote('para(14,15),demod([10,14])')] ).
cnf(101,plain,
equal(multiply(A,multiply(B,C,A),B),multiply(B,C,A)),
inference(para,[status(thm),theory(equality)],[3,98]),
[iquote('para(3,98)')] ).
cnf(123,plain,
equal(multiply(A,B,multiply(C,B,multiply(D,A,B))),multiply(C,B,multiply(D,A,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,21]),10]),
[iquote('para(10,21),demod([10])')] ).
cnf(124,plain,
equal(multiply(A,B,multiply(C,B,A)),multiply(C,B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,123]),3]),
[iquote('para(3,123),demod([3])')] ).
cnf(160,plain,
equal(multiply(A,B,multiply(C,D,multiply(A,B,C))),multiply(A,B,C)),
inference(para,[status(thm),theory(equality)],[31,14]),
[iquote('para(31,14)')] ).
cnf(231,plain,
equal(multiply(multiply(A,B,C),D,C),multiply(C,multiply(A,B,C),multiply(A,D,C))),
inference(para,[status(thm),theory(equality)],[101,47]),
[iquote('para(101,47)')] ).
cnf(336,plain,
equal(multiply(A,multiply(B,C,A),multiply(D,C,multiply(B,C,A))),multiply(B,C,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,124]),10,14]),
[iquote('para(14,124),demod([10,14])')] ).
cnf(337,plain,
equal(multiply(A,multiply(B,C,A),C),multiply(B,C,A)),
inference(para,[status(thm),theory(equality)],[3,336]),
[iquote('para(3,336)')] ).
cnf(459,plain,
equal(multiply(multiply(A,B,C),D,multiply(C,D,A)),multiply(C,D,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[160,337]),25,13,337,160]),
[iquote('para(160,337),demod([25,13,337,160])')] ).
cnf(532,plain,
equal(multiply(multiply(A,B,C),D,multiply(B,D,C)),multiply(B,D,C)),
inference(para,[status(thm),theory(equality)],[337,459]),
[iquote('para(337,459)')] ).
cnf(535,plain,
equal(multiply(A,multiply(B,inverse(C),A),multiply(B,C,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,532]),231,4]),
[iquote('para(4,532),demod([231,4])')] ).
cnf(540,plain,
equal(multiply(A,inverse(A),B),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,535]),101]),
[iquote('para(3,535),demod([101])')] ).
cnf(541,plain,
$false,
inference(conflict,[status(thm)],[540,5]),
[iquote('conflict(540,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : BOO002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n023.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 : Wed Jun 1 19:55:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.70/1.18 ----- EQP 0.9e, May 2009 -----
% 0.70/1.18 The job began on n023.cluster.edu, Wed Jun 1 19:55:56 2022
% 0.70/1.18 The command was "./eqp09e".
% 0.70/1.18
% 0.70/1.18 set(prolog_style_variables).
% 0.70/1.18 set(lrpo).
% 0.70/1.18 set(basic_paramod).
% 0.70/1.18 set(functional_subsume).
% 0.70/1.18 set(ordered_paramod).
% 0.70/1.18 set(prime_paramod).
% 0.70/1.18 set(para_pairs).
% 0.70/1.18 assign(pick_given_ratio,4).
% 0.70/1.18 clear(print_kept).
% 0.70/1.18 clear(print_new_demod).
% 0.70/1.18 clear(print_back_demod).
% 0.70/1.18 clear(print_given).
% 0.70/1.18 assign(max_mem,64000).
% 0.70/1.18 end_of_commands.
% 0.70/1.18
% 0.70/1.18 Usable:
% 0.70/1.18 end_of_list.
% 0.70/1.18
% 0.70/1.18 Sos:
% 0.70/1.18 0 (wt=-1) [] multiply(multiply(A,B,C),D,multiply(A,B,E)) = multiply(A,B,multiply(C,D,E)).
% 0.70/1.18 0 (wt=-1) [] multiply(A,B,B) = B.
% 0.70/1.18 0 (wt=-1) [] multiply(A,A,B) = A.
% 0.70/1.18 0 (wt=-1) [] multiply(inverse(A),A,B) = B.
% 0.70/1.18 0 (wt=-1) [] -(multiply(a,inverse(a),b) = b).
% 0.70/1.18 end_of_list.
% 0.70/1.18
% 0.70/1.18 Demodulators:
% 0.70/1.18 end_of_list.
% 0.70/1.18
% 0.70/1.18 Passive:
% 0.70/1.18 end_of_list.
% 0.70/1.18
% 0.70/1.18 Starting to process input.
% 0.70/1.18
% 0.70/1.18 ** KEPT: 1 (wt=18) [] multiply(multiply(A,B,C),D,multiply(A,B,E)) = multiply(A,B,multiply(C,D,E)).
% 0.70/1.18 1 is a new demodulator.
% 0.70/1.18
% 0.70/1.18 ** KEPT: 2 (wt=6) [] multiply(A,B,B) = B.
% 0.70/1.18 2 is a new demodulator.
% 0.70/1.18
% 0.70/1.18 ** KEPT: 3 (wt=6) [] multiply(A,A,B) = A.
% 0.70/1.18 3 is a new demodulator.
% 0.70/1.18
% 0.70/1.18 ** KEPT: 4 (wt=7) [] multiply(inverse(A),A,B) = B.
% 0.70/1.18 4 is a new demodulator.
% 0.70/1.18
% 0.70/1.18 ** KEPT: 5 (wt=7) [] -(multiply(a,inverse(a),b) = b).
% 0.70/1.18 ---------------- PROOF FOUND ----------------
% 0.70/1.18 % SZS status Unsatisfiable
% 0.70/1.18
% 0.70/1.18
% 0.70/1.18 After processing input:
% 0.70/1.18
% 0.70/1.18 Usable:
% 0.70/1.18 end_of_list.
% 0.70/1.18
% 0.70/1.18 Sos:
% 0.70/1.18 2 (wt=6) [] multiply(A,B,B) = B.
% 0.70/1.18 3 (wt=6) [] multiply(A,A,B) = A.
% 0.70/1.18 4 (wt=7) [] multiply(inverse(A),A,B) = B.
% 0.70/1.18 5 (wt=7) [] -(multiply(a,inverse(a),b) = b).
% 0.70/1.18 1 (wt=18) [] multiply(multiply(A,B,C),D,multiply(A,B,E)) = multiply(A,B,multiply(C,D,E)).
% 0.70/1.18 end_of_list.
% 0.70/1.18
% 0.70/1.18 Demodulators:
% 0.70/1.18 1 (wt=18) [] multiply(multiply(A,B,C),D,multiply(A,B,E)) = multiply(A,B,multiply(C,D,E)).
% 0.70/1.18 2 (wt=6) [] multiply(A,B,B) = B.
% 0.70/1.18 3 (wt=6) [] multiply(A,A,B) = A.
% 0.70/1.18 4 (wt=7) [] multiply(inverse(A),A,B) = B.
% 0.70/1.18 end_of_list.
% 0.70/1.18
% 0.70/1.18 Passive:
% 0.70/1.18 end_of_list.
% 0.70/1.18
% 0.70/1.18 UNIT CONFLICT from 540 and 5 at 0.07 seconds.
% 0.70/1.18
% 0.70/1.18 ---------------- PROOF ----------------
% 0.70/1.18 % SZS output start Refutation
% See solution above
% 0.70/1.18 ------------ end of proof -------------
% 0.70/1.18
% 0.70/1.18
% 0.70/1.18 ------------- memory usage ------------
% 0.70/1.18 Memory dynamically allocated (tp_alloc): 1464.
% 0.70/1.18 type (bytes each) gets frees in use avail bytes
% 0.70/1.18 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.70/1.18 term ( 16) 76398 55449 20949 34 407.7 K
% 0.70/1.18 gen_ptr ( 8) 91720 7044 84676 29 661.8 K
% 0.70/1.18 context ( 808) 28266 28264 2 4 4.7 K
% 0.70/1.18 trail ( 12) 60556 60556 0 15 0.2 K
% 0.70/1.18 bt_node ( 68) 10310 10306 4 21 1.7 K
% 0.70/1.18 ac_position (285432) 0 0 0 0 0.0 K
% 0.70/1.18 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.70/1.18 ac_match_free_vars_pos (4020)
% 0.70/1.18 0 0 0 0 0.0 K
% 0.70/1.18 discrim ( 12) 17978 341 17637 0 206.7 K
% 0.70/1.18 flat ( 40) 166013 166013 0 99 3.9 K
% 0.70/1.18 discrim_pos ( 12) 2364 2364 0 1 0.0 K
% 0.70/1.18 fpa_head ( 12) 1367 0 1367 0 16.0 K
% 0.70/1.18 fpa_tree ( 28) 1208 1208 0 9 0.2 K
% 0.70/1.18 fpa_pos ( 36) 865 865 0 1 0.0 K
% 0.70/1.18 literal ( 12) 2352 1812 540 1 6.3 K
% 0.70/1.18 clause ( 24) 2352 1812 540 1 12.7 K
% 0.70/1.18 list ( 12) 384 328 56 3 0.7 K
% 0.70/1.18 list_pos ( 20) 1985 92 1893 0 37.0 K
% 0.70/1.18 pair_index ( 40) 2 0 2 0 0.1 K
% 0.70/1.18
% 0.70/1.18 -------------- statistics -------------
% 0.70/1.18 Clauses input 5
% 0.70/1.18 Usable input 0
% 0.70/1.18 Sos input 5
% 0.70/1.18 Demodulators input 0
% 0.70/1.18 Passive input 0
% 0.70/1.18
% 0.70/1.18 Processed BS (before search) 5
% 0.70/1.18 Forward subsumed BS 0
% 0.70/1.18 Kept BS 5
% 0.70/1.18 New demodulators BS 4
% 0.70/1.18 Back demodulated BS 0
% 0.70/1.18
% 0.70/1.18 Clauses or pairs given 807
% 0.70/1.18 Clauses generated 1514
% 0.70/1.18 Forward subsumed 979
% 0.70/1.18 Deleted by weight 0
% 0.70/1.18 Deleted by variable count 0
% 0.70/1.18 Kept 535
% 0.70/1.18 New demodulators 321
% 0.70/1.18 Back demodulated 19
% 0.70/1.18 Ordered paramod prunes 0
% 0.70/1.18 Basic paramod prunes 869
% 0.70/1.18 Prime paramod prunes 85
% 0.70/1.18 Semantic prunes 0
% 0.70/1.18
% 0.70/1.18 Rewrite attmepts 18208
% 0.70/1.18 Rewrites 2109
% 0.70/1.18
% 0.70/1.18 FPA overloads 0
% 0.70/1.18 FPA underloads 0
% 0.70/1.18
% 0.70/1.18 Usable size 0
% 0.70/1.18 Sos size 520
% 0.70/1.18 Demodulators size 314
% 0.70/1.18 Passive size 0
% 0.70/1.18 Disabled size 19
% 0.70/1.18
% 0.70/1.18 Proofs found 1
% 0.70/1.18
% 0.70/1.18 ----------- times (seconds) ----------- Wed Jun 1 19:55:57 2022
% 0.70/1.18
% 0.70/1.18 user CPU time 0.07 (0 hr, 0 min, 0 sec)
% 0.70/1.18 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.70/1.18 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 0.70/1.18 input time 0.00
% 0.70/1.18 paramodulation time 0.01
% 0.70/1.18 demodulation time 0.01
% 0.70/1.18 orient time 0.00
% 0.70/1.18 weigh time 0.00
% 0.70/1.18 forward subsume time 0.00
% 0.70/1.18 back demod find time 0.01
% 0.70/1.18 conflict time 0.00
% 0.70/1.18 LRPO time 0.00
% 0.70/1.18 store clause time 0.01
% 0.70/1.18 disable clause time 0.00
% 0.70/1.18 prime paramod time 0.01
% 0.70/1.18 semantics time 0.00
% 0.70/1.18
% 0.70/1.18 EQP interrupted
%------------------------------------------------------------------------------