TSTP Solution File: GRP148-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP148-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n014.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:31 EDT 2022
% Result : Unsatisfiable 0.72s 1.13s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 7 RR)
% Number of literals : 14 ( 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 : 12 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP148-1.p',unknown),
[] ).
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP148-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(11,plain,
equal(greatest_lower_bound(A,least_upper_bound(A,B)),A),
file('GRP148-1.p',unknown),
[] ).
cnf(16,plain,
equal(least_upper_bound(a,c),c),
file('GRP148-1.p',unknown),
[] ).
cnf(17,plain,
equal(least_upper_bound(b,c),c),
file('GRP148-1.p',unknown),
[] ).
cnf(18,plain,
~ equal(greatest_lower_bound(least_upper_bound(a,b),c),least_upper_bound(a,b)),
file('GRP148-1.p',unknown),
[] ).
cnf(20,plain,
equal(least_upper_bound(c,a),c),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,5]),1]),
[iquote('para(16,5),flip(1)')] ).
cnf(22,plain,
equal(least_upper_bound(c,b),c),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,5]),1]),
[iquote('para(17,5),flip(1)')] ).
cnf(43,plain,
equal(greatest_lower_bound(A,least_upper_bound(B,A)),A),
inference(para,[status(thm),theory(equality)],[5,11]),
[iquote('para(5,11)')] ).
cnf(72,plain,
equal(least_upper_bound(c,least_upper_bound(a,A)),least_upper_bound(c,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,7]),1]),
[iquote('para(20,7),flip(1)')] ).
cnf(172,plain,
equal(greatest_lower_bound(least_upper_bound(a,A),least_upper_bound(c,A)),least_upper_bound(a,A)),
inference(para,[status(thm),theory(equality)],[72,43]),
[iquote('para(72,43)')] ).
cnf(257,plain,
equal(greatest_lower_bound(least_upper_bound(a,b),c),least_upper_bound(a,b)),
inference(para,[status(thm),theory(equality)],[22,172]),
[iquote('para(22,172)')] ).
cnf(258,plain,
$false,
inference(conflict,[status(thm)],[257,18]),
[iquote('conflict(257,18)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP148-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 05:57:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.72/1.13 ----- EQP 0.9e, May 2009 -----
% 0.72/1.13 The job began on n014.cluster.edu, Mon Jun 13 05:57:23 2022
% 0.72/1.13 The command was "./eqp09e".
% 0.72/1.13
% 0.72/1.13 set(prolog_style_variables).
% 0.72/1.13 set(lrpo).
% 0.72/1.13 set(basic_paramod).
% 0.72/1.13 set(functional_subsume).
% 0.72/1.13 set(ordered_paramod).
% 0.72/1.13 set(prime_paramod).
% 0.72/1.13 set(para_pairs).
% 0.72/1.13 assign(pick_given_ratio,4).
% 0.72/1.13 clear(print_kept).
% 0.72/1.13 clear(print_new_demod).
% 0.72/1.13 clear(print_back_demod).
% 0.72/1.13 clear(print_given).
% 0.72/1.13 assign(max_mem,64000).
% 0.72/1.13 end_of_commands.
% 0.72/1.13
% 0.72/1.13 Usable:
% 0.72/1.13 end_of_list.
% 0.72/1.13
% 0.72/1.13 Sos:
% 0.72/1.13 0 (wt=-1) [] multiply(identity,A) = A.
% 0.72/1.13 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.72/1.13 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.72/1.13 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.72/1.13 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.72/1.13 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.72/1.13 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.72/1.13 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.72/1.13 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.72/1.13 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.72/1.13 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.72/1.13 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.13 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.13 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.13 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.13 0 (wt=-1) [] least_upper_bound(a,c) = c.
% 0.72/1.13 0 (wt=-1) [] least_upper_bound(b,c) = c.
% 0.72/1.13 0 (wt=-1) [] -(greatest_lower_bound(least_upper_bound(a,b),c) = least_upper_bound(a,b)).
% 0.72/1.13 end_of_list.
% 0.72/1.13
% 0.72/1.13 Demodulators:
% 0.72/1.13 end_of_list.
% 0.72/1.13
% 0.72/1.13 Passive:
% 0.72/1.13 end_of_list.
% 0.72/1.13
% 0.72/1.13 Starting to process input.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.72/1.13 1 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.72/1.13 2 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.72/1.13 3 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.72/1.13 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.72/1.13
% 0.72/1.13 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.72/1.13 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.72/1.13
% 0.72/1.13 ** 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.72/1.13 6 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** 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.72/1.13 7 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.72/1.13 8 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.72/1.13 9 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.72/1.13 10 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.72/1.13 11 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.13 12 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.13 13 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.13 14 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.13 15 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 16 (wt=5) [] least_upper_bound(a,c) = c.
% 0.72/1.13 16 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 17 (wt=5) [] least_upper_bound(b,c) = c.
% 0.72/1.13 17 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 18 (wt=9) [] -(greatest_lower_bound(least_upper_bound(a,b),c) = least_upper_bound(a,b)).
% 0.72/1.13 ---------------- PROOF FOUND ----------------
% 0.72/1.13 % SZS status Unsatisfiable
% 0.72/1.13
% 0.72/1.13
% 0.72/1.13 After processing input:
% 0.72/1.13
% 0.72/1.13 Usable:
% 0.72/1.13 end_of_list.
% 0.72/1.13
% 0.72/1.13 Sos:
% 0.72/1.13 1 (wt=5) [] multiply(identity,A) = A.
% 0.72/1.13 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.72/1.13 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.72/1.13 16 (wt=5) [] least_upper_bound(a,c) = c.
% 0.72/1.13 17 (wt=5) [] least_upper_bound(b,c) = c.
% 0.72/1.13 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.72/1.13 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.72/1.13 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.72/1.13 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.72/1.13 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.72/1.13 18 (wt=9) [] -(greatest_lower_bound(least_upper_bound(a,b),c) = least_upper_bound(a,b)).
% 0.72/1.13 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.72/1.13 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.72/1.13 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.72/1.13 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.13 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.13 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.13 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.13 end_of_list.
% 0.72/1.13
% 0.72/1.13 Demodulators:
% 0.72/1.13 1 (wt=5) [] multiply(identity,A) = A.
% 0.72/1.13 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.72/1.13 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.72/1.13 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.72/1.13 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.72/1.13 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.72/1.13 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.72/1.13 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.72/1.13 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.72/1.13 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.13 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.13 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.13 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.13 16 (wt=5) [] least_upper_bound(a,c) = c.
% 0.72/1.13 17 (wt=5) [] least_upper_bound(b,c) = c.
% 0.72/1.13 end_of_list.
% 0.72/1.13
% 0.72/1.13 Passive:
% 0.72/1.13 end_of_list.
% 0.72/1.13
% 0.72/1.13 UNIT CONFLICT from 257 and 18 at 0.02 seconds.
% 0.72/1.13
% 0.72/1.13 ---------------- PROOF ----------------
% 0.72/1.13 % SZS output start Refutation
% See solution above
% 0.72/1.13 ------------ end of proof -------------
% 0.72/1.13
% 0.72/1.13
% 0.72/1.13 ------------- memory usage ------------
% 0.72/1.13 Memory dynamically allocated (tp_alloc): 488.
% 0.72/1.13 type (bytes each) gets frees in use avail bytes
% 0.72/1.13 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.72/1.13 term ( 16) 23604 20535 3069 18 59.3 K
% 0.72/1.13 gen_ptr ( 8) 16769 6075 10694 13 83.6 K
% 0.72/1.13 context ( 808) 29088 29086 2 4 4.7 K
% 0.72/1.13 trail ( 12) 1019 1019 0 4 0.0 K
% 0.72/1.13 bt_node ( 68) 14494 14491 3 6 0.6 K
% 0.72/1.13 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.13 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.13 ac_match_free_vars_pos (4020)
% 0.72/1.13 0 0 0 0 0.0 K
% 0.72/1.13 discrim ( 12) 2406 143 2263 0 26.5 K
% 0.72/1.13 flat ( 40) 32695 32695 0 17 0.7 K
% 0.72/1.13 discrim_pos ( 12) 1515 1515 0 1 0.0 K
% 0.72/1.13 fpa_head ( 12) 1018 0 1018 0 11.9 K
% 0.72/1.13 fpa_tree ( 28) 528 528 0 15 0.4 K
% 0.72/1.13 fpa_pos ( 36) 459 459 0 1 0.0 K
% 0.72/1.13 literal ( 12) 1669 1412 257 1 3.0 K
% 0.72/1.13 clause ( 24) 1669 1412 257 1 6.0 K
% 0.72/1.13 list ( 12) 261 205 56 3 0.7 K
% 0.72/1.13 list_pos ( 20) 1038 127 911 0 17.8 K
% 0.72/1.13 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.13
% 0.72/1.13 -------------- statistics -------------
% 0.72/1.13 Clauses input 18
% 0.72/1.13 Usable input 0
% 0.72/1.13 Sos input 18
% 0.72/1.13 Demodulators input 0
% 0.72/1.13 Passive input 0
% 0.72/1.13
% 0.72/1.13 Processed BS (before search) 20
% 0.72/1.13 Forward subsumed BS 2
% 0.72/1.13 Kept BS 18
% 0.72/1.13 New demodulators BS 15
% 0.72/1.13 Back demodulated BS 0
% 0.72/1.13
% 0.72/1.13 Clauses or pairs given 3492
% 0.72/1.13 Clauses generated 1172
% 0.72/1.13 Forward subsumed 933
% 0.72/1.13 Deleted by weight 0
% 0.72/1.13 Deleted by variable count 0
% 0.72/1.13 Kept 239
% 0.72/1.13 New demodulators 187
% 0.72/1.13 Back demodulated 25
% 0.72/1.13 Ordered paramod prunes 0
% 0.72/1.13 Basic paramod prunes 8327
% 0.72/1.13 Prime paramod prunes 24
% 0.72/1.13 Semantic prunes 0
% 0.72/1.13
% 0.72/1.13 Rewrite attmepts 8499
% 0.72/1.13 Rewrites 1335
% 0.72/1.13
% 0.72/1.13 FPA overloads 0
% 0.72/1.13 FPA underloads 0
% 0.72/1.13
% 0.72/1.13 Usable size 0
% 0.72/1.13 Sos size 231
% 0.72/1.13 Demodulators size 193
% 0.72/1.13 Passive size 0
% 0.72/1.13 Disabled size 25
% 0.72/1.13
% 0.72/1.13 Proofs found 1
% 0.72/1.13
% 0.72/1.13 ----------- times (seconds) ----------- Mon Jun 13 05:57:23 2022
% 0.72/1.13
% 0.72/1.13 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.72/1.13 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.72/1.13 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.72/1.13 input time 0.00
% 0.72/1.13 paramodulation time 0.00
% 0.72/1.13 demodulation time 0.00
% 0.72/1.13 orient time 0.00
% 0.72/1.13 weigh time 0.00
% 0.72/1.13 forward subsume time 0.00
% 0.72/1.13 back demod find time 0.00
% 0.72/1.13 conflict time 0.00
% 0.72/1.13 LRPO time 0.00
% 0.72/1.13 store clause time 0.00
% 0.72/1.13 disable clause time 0.00
% 0.72/1.13 prime paramod time 0.00
% 0.72/1.13 semantics time 0.00
% 0.72/1.13
% 0.72/1.13 EQP interrupted
%------------------------------------------------------------------------------