TSTP Solution File: GRP152-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP152-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n016.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 : Sat Jul 16 08:45:32 EDT 2022
% Result : Unsatisfiable 0.43s 1.07s
% Output : Refutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 3 RR)
% Number of literals : 11 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP152-1.p',unknown),
[] ).
cnf(4,plain,
equal(greatest_lower_bound(A,B),greatest_lower_bound(B,A)),
file('GRP152-1.p',unknown),
[] ).
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP152-1.p',unknown),
[] ).
cnf(7,plain,
equal(least_upper_bound(least_upper_bound(A,B),C),least_upper_bound(A,least_upper_bound(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(10,plain,
equal(least_upper_bound(A,greatest_lower_bound(A,B)),A),
file('GRP152-1.p',unknown),
[] ).
cnf(11,plain,
equal(greatest_lower_bound(A,least_upper_bound(A,B)),A),
file('GRP152-1.p',unknown),
[] ).
cnf(16,plain,
~ equal(least_upper_bound(b,least_upper_bound(a,b)),least_upper_bound(a,b)),
file('GRP152-1.p',unknown),
[] ).
cnf(19,plain,
equal(least_upper_bound(A,greatest_lower_bound(B,A)),A),
inference(para,[status(thm),theory(equality)],[4,10]),
[iquote('para(4,10)')] ).
cnf(27,plain,
equal(least_upper_bound(A,least_upper_bound(B,A)),least_upper_bound(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,19]),7]),
[iquote('para(11,19),demod([7])')] ).
cnf(28,plain,
~ equal(least_upper_bound(b,a),least_upper_bound(a,b)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[16]),27]),
[iquote('back_demod(16),demod([27])')] ).
cnf(29,plain,
$false,
inference(conflict,[status(thm)],[28,5]),
[iquote('conflict(28,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP152-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n016.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 : Mon Jun 13 10:28:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.07 ----- EQP 0.9e, May 2009 -----
% 0.43/1.07 The job began on n016.cluster.edu, Mon Jun 13 10:28:30 2022
% 0.43/1.07 The command was "./eqp09e".
% 0.43/1.07
% 0.43/1.07 set(prolog_style_variables).
% 0.43/1.07 set(lrpo).
% 0.43/1.07 set(basic_paramod).
% 0.43/1.07 set(functional_subsume).
% 0.43/1.07 set(ordered_paramod).
% 0.43/1.07 set(prime_paramod).
% 0.43/1.07 set(para_pairs).
% 0.43/1.07 assign(pick_given_ratio,4).
% 0.43/1.07 clear(print_kept).
% 0.43/1.07 clear(print_new_demod).
% 0.43/1.07 clear(print_back_demod).
% 0.43/1.07 clear(print_given).
% 0.43/1.07 assign(max_mem,64000).
% 0.43/1.07 end_of_commands.
% 0.43/1.07
% 0.43/1.07 Usable:
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Sos:
% 0.43/1.07 0 (wt=-1) [] multiply(identity,A) = A.
% 0.43/1.07 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.43/1.07 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.07 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.43/1.07 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.43/1.07 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.43/1.07 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.43/1.07 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.43/1.07 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.43/1.07 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.43/1.07 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.43/1.07 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 0 (wt=-1) [] -(least_upper_bound(b,least_upper_bound(a,b)) = least_upper_bound(a,b)).
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Demodulators:
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Passive:
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Starting to process input.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.43/1.07 1 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.43/1.07 2 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.07 3 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.43/1.07 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.43/1.07
% 0.43/1.07 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.43/1.07 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.43/1.07
% 0.43/1.07 ** KEPT: 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.43/1.07 6 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.43/1.07 7 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.43/1.07 8 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.43/1.07 9 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.43/1.07 10 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.43/1.07 11 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 12 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 13 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 14 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 15 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 16 (wt=9) [] -(least_upper_bound(b,least_upper_bound(a,b)) = least_upper_bound(a,b)).
% 0.43/1.07 ---------------- PROOF FOUND ----------------
% 0.43/1.07 % SZS status Unsatisfiable
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 After processing input:
% 0.43/1.07
% 0.43/1.07 Usable:
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Sos:
% 0.43/1.07 1 (wt=5) [] multiply(identity,A) = A.
% 0.43/1.07 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.43/1.07 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.43/1.07 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.43/1.07 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.43/1.07 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.43/1.07 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.43/1.07 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.43/1.07 16 (wt=9) [] -(least_upper_bound(b,least_upper_bound(a,b)) = least_upper_bound(a,b)).
% 0.43/1.07 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.07 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.43/1.07 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.43/1.07 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Demodulators:
% 0.43/1.07 1 (wt=5) [] multiply(identity,A) = A.
% 0.43/1.07 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.43/1.07 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.07 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.43/1.07 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.43/1.07 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.43/1.07 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.43/1.07 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.43/1.07 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.43/1.07 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Passive:
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 UNIT CONFLICT from 28 and 5 at 0.00 seconds.
% 0.43/1.07
% 0.43/1.07 ---------------- PROOF ----------------
% 0.43/1.07 % SZS output start Refutation
% See solution above
% 0.43/1.07 ------------ end of proof -------------
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 ------------- memory usage ------------
% 0.43/1.07 Memory dynamically allocated (tp_alloc): 488.
% 0.43/1.07 type (bytes each) gets frees in use avail bytes
% 0.43/1.07 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.43/1.07 term ( 16) 1787 1542 245 12 4.9 K
% 0.43/1.07 gen_ptr ( 8) 970 293 677 10 5.4 K
% 0.43/1.07 context ( 808) 753 751 2 3 3.9 K
% 0.43/1.07 trail ( 12) 74 74 0 3 0.0 K
% 0.43/1.07 bt_node ( 68) 304 301 3 3 0.4 K
% 0.43/1.07 ac_position (285432) 0 0 0 0 0.0 K
% 0.43/1.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.43/1.07 ac_match_free_vars_pos (4020)
% 0.43/1.07 0 0 0 0 0.0 K
% 0.43/1.07 discrim ( 12) 226 9 217 9 2.6 K
% 0.43/1.07 flat ( 40) 824 824 0 11 0.4 K
% 0.43/1.07 discrim_pos ( 12) 31 31 0 1 0.0 K
% 0.43/1.07 fpa_head ( 12) 174 0 174 0 2.0 K
% 0.43/1.07 fpa_tree ( 28) 44 44 0 9 0.2 K
% 0.43/1.07 fpa_pos ( 36) 49 49 0 1 0.0 K
% 0.43/1.07 literal ( 12) 91 63 28 0 0.3 K
% 0.43/1.07 clause ( 24) 91 63 28 0 0.7 K
% 0.43/1.07 list ( 12) 80 23 57 2 0.7 K
% 0.43/1.07 list_pos ( 20) 120 20 100 3 2.0 K
% 0.43/1.07 pair_index ( 40) 2 0 2 0 0.1 K
% 0.43/1.07
% 0.43/1.07 -------------- statistics -------------
% 0.43/1.07 Clauses input 16
% 0.43/1.07 Usable input 0
% 0.43/1.07 Sos input 16
% 0.43/1.07 Demodulators input 0
% 0.43/1.07 Passive input 0
% 0.43/1.07
% 0.43/1.07 Processed BS (before search) 18
% 0.43/1.07 Forward subsumed BS 2
% 0.43/1.07 Kept BS 16
% 0.43/1.07 New demodulators BS 13
% 0.43/1.07 Back demodulated BS 0
% 0.43/1.07
% 0.43/1.07 Clauses or pairs given 91
% 0.43/1.07 Clauses generated 42
% 0.43/1.07 Forward subsumed 30
% 0.43/1.07 Deleted by weight 0
% 0.43/1.07 Deleted by variable count 0
% 0.43/1.07 Kept 12
% 0.43/1.07 New demodulators 8
% 0.43/1.07 Back demodulated 1
% 0.43/1.07 Ordered paramod prunes 0
% 0.43/1.07 Basic paramod prunes 48
% 0.43/1.07 Prime paramod prunes 0
% 0.43/1.07 Semantic prunes 0
% 0.43/1.07
% 0.43/1.07 Rewrite attmepts 252
% 0.43/1.07 Rewrites 27
% 0.43/1.07
% 0.43/1.07 FPA overloads 0
% 0.43/1.07 FPA underloads 0
% 0.43/1.07
% 0.43/1.07 Usable size 0
% 0.43/1.07 Sos size 26
% 0.43/1.07 Demodulators size 21
% 0.43/1.07 Passive size 0
% 0.43/1.07 Disabled size 1
% 0.43/1.07
% 0.43/1.07 Proofs found 1
% 0.43/1.07
% 0.43/1.07 ----------- times (seconds) ----------- Mon Jun 13 10:28:30 2022
% 0.43/1.07
% 0.43/1.07 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.43/1.07 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.43/1.07 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.43/1.07 input time 0.00
% 0.43/1.07 paramodulation time 0.00
% 0.43/1.07 demodulation time 0.00
% 0.43/1.07 orient time 0.00
% 0.43/1.07 weigh time 0.00
% 0.43/1.07 forward subsume time 0.00
% 0.43/1.07 back demod find time 0.00
% 0.43/1.07 conflict time 0.00
% 0.43/1.07 LRPO time 0.00
% 0.43/1.07 store clause time 0.00
% 0.43/1.07 disable clause time 0.00
% 0.43/1.07 prime paramod time 0.00
% 0.43/1.07 semantics time 0.00
% 0.43/1.07
% 0.43/1.07 EQP interrupted
%------------------------------------------------------------------------------