TSTP Solution File: GRP138-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP138-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n008.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:29 EDT 2022
% Result : Unsatisfiable 0.71s 1.12s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 9 RR)
% Number of literals : 18 ( 0 equ; 1 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP138-1.p',unknown),
[] ).
cnf(4,plain,
equal(greatest_lower_bound(A,B),greatest_lower_bound(B,A)),
file('GRP138-1.p',unknown),
[] ).
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP138-1.p',unknown),
[] ).
cnf(6,plain,
equal(greatest_lower_bound(greatest_lower_bound(A,B),C),greatest_lower_bound(A,greatest_lower_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('GRP138-1.p',unknown),
[] ).
cnf(11,plain,
equal(greatest_lower_bound(A,least_upper_bound(A,B)),A),
file('GRP138-1.p',unknown),
[] ).
cnf(16,plain,
equal(least_upper_bound(a,c),a),
file('GRP138-1.p',unknown),
[] ).
cnf(17,plain,
equal(least_upper_bound(b,c),b),
file('GRP138-1.p',unknown),
[] ).
cnf(18,plain,
~ equal(least_upper_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(a,b)),
file('GRP138-1.p',unknown),
[] ).
cnf(20,plain,
equal(least_upper_bound(c,a),a),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,5]),1]),
[iquote('para(16,5),flip(1)')] ).
cnf(21,plain,
equal(least_upper_bound(c,b),b),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,5]),1]),
[iquote('para(17,5),flip(1)')] ).
cnf(22,plain,
equal(greatest_lower_bound(c,a),c),
inference(para,[status(thm),theory(equality)],[20,11]),
[iquote('para(20,11)')] ).
cnf(26,plain,
equal(greatest_lower_bound(c,b),c),
inference(para,[status(thm),theory(equality)],[21,11]),
[iquote('para(21,11)')] ).
cnf(37,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(79,plain,
equal(greatest_lower_bound(c,greatest_lower_bound(a,A)),greatest_lower_bound(c,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,6]),1]),
[iquote('para(22,6),flip(1)')] ).
cnf(170,plain,
equal(least_upper_bound(greatest_lower_bound(a,A),greatest_lower_bound(c,A)),greatest_lower_bound(a,A)),
inference(para,[status(thm),theory(equality)],[79,37]),
[iquote('para(79,37)')] ).
cnf(255,plain,
equal(least_upper_bound(greatest_lower_bound(a,b),c),greatest_lower_bound(a,b)),
inference(para,[status(thm),theory(equality)],[26,170]),
[iquote('para(26,170)')] ).
cnf(256,plain,
$false,
inference(conflict,[status(thm)],[255,18]),
[iquote('conflict(255,18)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP138-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n008.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 20:46:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.12 ----- EQP 0.9e, May 2009 -----
% 0.71/1.12 The job began on n008.cluster.edu, Mon Jun 13 20:46:53 2022
% 0.71/1.12 The command was "./eqp09e".
% 0.71/1.12
% 0.71/1.12 set(prolog_style_variables).
% 0.71/1.12 set(lrpo).
% 0.71/1.12 set(basic_paramod).
% 0.71/1.12 set(functional_subsume).
% 0.71/1.12 set(ordered_paramod).
% 0.71/1.12 set(prime_paramod).
% 0.71/1.12 set(para_pairs).
% 0.71/1.12 assign(pick_given_ratio,4).
% 0.71/1.12 clear(print_kept).
% 0.71/1.12 clear(print_new_demod).
% 0.71/1.12 clear(print_back_demod).
% 0.71/1.12 clear(print_given).
% 0.71/1.12 assign(max_mem,64000).
% 0.71/1.12 end_of_commands.
% 0.71/1.12
% 0.71/1.12 Usable:
% 0.71/1.12 end_of_list.
% 0.71/1.12
% 0.71/1.12 Sos:
% 0.71/1.12 0 (wt=-1) [] multiply(identity,A) = A.
% 0.71/1.12 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.71/1.12 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.71/1.12 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.71/1.12 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.71/1.12 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.71/1.12 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.71/1.12 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.71/1.12 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.71/1.12 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.71/1.12 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.71/1.12 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.71/1.12 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.71/1.12 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.71/1.12 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.71/1.12 0 (wt=-1) [] least_upper_bound(a,c) = a.
% 0.71/1.12 0 (wt=-1) [] least_upper_bound(b,c) = b.
% 0.71/1.12 0 (wt=-1) [] -(least_upper_bound(greatest_lower_bound(a,b),c) = greatest_lower_bound(a,b)).
% 0.71/1.12 end_of_list.
% 0.71/1.12
% 0.71/1.12 Demodulators:
% 0.71/1.12 end_of_list.
% 0.71/1.12
% 0.71/1.12 Passive:
% 0.71/1.12 end_of_list.
% 0.71/1.12
% 0.71/1.12 Starting to process input.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.71/1.12 1 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.71/1.12 2 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.71/1.12 3 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.71/1.12 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.71/1.12
% 0.71/1.12 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.71/1.12 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.71/1.12
% 0.71/1.12 ** 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.71/1.12 6 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** 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.71/1.12 7 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.71/1.12 8 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.71/1.12 9 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.71/1.12 10 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.71/1.12 11 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.71/1.12 12 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.71/1.12 13 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.71/1.12 14 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.71/1.12 15 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 16 (wt=5) [] least_upper_bound(a,c) = a.
% 0.71/1.12 16 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 17 (wt=5) [] least_upper_bound(b,c) = b.
% 0.71/1.12 17 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 18 (wt=9) [] -(least_upper_bound(greatest_lower_bound(a,b),c) = greatest_lower_bound(a,b)).
% 0.71/1.12 ---------------- PROOF FOUND ----------------
% 0.71/1.12 % SZS status Unsatisfiable
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 After processing input:
% 0.71/1.12
% 0.71/1.12 Usable:
% 0.71/1.12 end_of_list.
% 0.71/1.12
% 0.71/1.12 Sos:
% 0.71/1.12 1 (wt=5) [] multiply(identity,A) = A.
% 0.71/1.12 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.71/1.12 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.71/1.12 16 (wt=5) [] least_upper_bound(a,c) = a.
% 0.71/1.12 17 (wt=5) [] least_upper_bound(b,c) = b.
% 0.71/1.12 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.71/1.12 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.71/1.12 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.71/1.12 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.71/1.12 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.71/1.12 18 (wt=9) [] -(least_upper_bound(greatest_lower_bound(a,b),c) = greatest_lower_bound(a,b)).
% 0.71/1.12 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.71/1.12 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.71/1.12 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.71/1.12 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.71/1.12 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.71/1.12 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.71/1.12 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.71/1.12 end_of_list.
% 0.71/1.12
% 0.71/1.12 Demodulators:
% 0.71/1.12 1 (wt=5) [] multiply(identity,A) = A.
% 0.71/1.12 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.71/1.12 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.71/1.12 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.71/1.12 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.71/1.12 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.71/1.12 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.71/1.12 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.71/1.12 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.71/1.12 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.71/1.12 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.71/1.12 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.71/1.12 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.71/1.12 16 (wt=5) [] least_upper_bound(a,c) = a.
% 0.71/1.12 17 (wt=5) [] least_upper_bound(b,c) = b.
% 0.71/1.12 end_of_list.
% 0.71/1.12
% 0.71/1.12 Passive:
% 0.71/1.12 end_of_list.
% 0.71/1.12
% 0.71/1.12 UNIT CONFLICT from 255 and 18 at 0.02 seconds.
% 0.71/1.12
% 0.71/1.12 ---------------- PROOF ----------------
% 0.71/1.12 % SZS output start Refutation
% See solution above
% 0.71/1.12 ------------ end of proof -------------
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 ------------- memory usage ------------
% 0.71/1.12 Memory dynamically allocated (tp_alloc): 488.
% 0.71/1.12 type (bytes each) gets frees in use avail bytes
% 0.71/1.12 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.71/1.12 term ( 16) 23558 20507 3051 18 58.9 K
% 0.71/1.12 gen_ptr ( 8) 16675 6036 10639 17 83.2 K
% 0.71/1.12 context ( 808) 28903 28901 2 4 4.7 K
% 0.71/1.12 trail ( 12) 1005 1005 0 4 0.0 K
% 0.71/1.12 bt_node ( 68) 14415 14412 3 6 0.6 K
% 0.71/1.12 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.12 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.12 ac_match_free_vars_pos (4020)
% 0.71/1.12 0 0 0 0 0.0 K
% 0.71/1.12 discrim ( 12) 2398 135 2263 0 26.5 K
% 0.71/1.12 flat ( 40) 32574 32574 0 17 0.7 K
% 0.71/1.12 discrim_pos ( 12) 1510 1510 0 1 0.0 K
% 0.71/1.12 fpa_head ( 12) 1016 0 1016 0 11.9 K
% 0.71/1.12 fpa_tree ( 28) 530 530 0 15 0.4 K
% 0.71/1.12 fpa_pos ( 36) 457 457 0 1 0.0 K
% 0.71/1.12 literal ( 12) 1656 1401 255 1 3.0 K
% 0.71/1.12 clause ( 24) 1656 1401 255 1 6.0 K
% 0.71/1.12 list ( 12) 261 205 56 3 0.7 K
% 0.71/1.12 list_pos ( 20) 1028 119 909 0 17.8 K
% 0.71/1.12 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.12
% 0.71/1.12 -------------- statistics -------------
% 0.71/1.12 Clauses input 18
% 0.71/1.12 Usable input 0
% 0.71/1.12 Sos input 18
% 0.71/1.12 Demodulators input 0
% 0.71/1.12 Passive input 0
% 0.71/1.12
% 0.71/1.12 Processed BS (before search) 20
% 0.71/1.12 Forward subsumed BS 2
% 0.71/1.12 Kept BS 18
% 0.71/1.12 New demodulators BS 15
% 0.71/1.12 Back demodulated BS 0
% 0.71/1.12
% 0.71/1.12 Clauses or pairs given 3458
% 0.71/1.12 Clauses generated 1164
% 0.71/1.12 Forward subsumed 927
% 0.71/1.12 Deleted by weight 0
% 0.71/1.12 Deleted by variable count 0
% 0.71/1.12 Kept 237
% 0.71/1.12 New demodulators 187
% 0.71/1.12 Back demodulated 23
% 0.71/1.12 Ordered paramod prunes 0
% 0.71/1.12 Basic paramod prunes 8265
% 0.71/1.12 Prime paramod prunes 24
% 0.71/1.12 Semantic prunes 0
% 0.71/1.12
% 0.71/1.12 Rewrite attmepts 8448
% 0.71/1.12 Rewrites 1333
% 0.71/1.12
% 0.71/1.12 FPA overloads 0
% 0.71/1.12 FPA underloads 0
% 0.71/1.12
% 0.71/1.12 Usable size 0
% 0.71/1.12 Sos size 231
% 0.71/1.12 Demodulators size 193
% 0.71/1.12 Passive size 0
% 0.71/1.12 Disabled size 23
% 0.71/1.12
% 0.71/1.12 Proofs found 1
% 0.71/1.12
% 0.71/1.12 ----------- times (seconds) ----------- Mon Jun 13 20:46:53 2022
% 0.71/1.12
% 0.71/1.12 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.71/1.12 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.71/1.12 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.12 input time 0.00
% 0.71/1.12 paramodulation time 0.01
% 0.71/1.12 demodulation time 0.00
% 0.71/1.12 orient time 0.00
% 0.71/1.12 weigh time 0.00
% 0.71/1.12 forward subsume time 0.00
% 0.71/1.12 back demod find time 0.00
% 0.71/1.12 conflict time 0.00
% 0.71/1.12 LRPO time 0.00
% 0.71/1.12 store clause time 0.00
% 0.71/1.12 disable clause time 0.00
% 0.71/1.12 prime paramod time 0.00
% 0.71/1.12 semantics time 0.00
% 0.71/1.12
% 0.71/1.12 EQP interrupted
%------------------------------------------------------------------------------