%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP144-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n020.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:30 EDT 2022
% Result : Unsatisfiable 0.75s 1.15s
% Output : Refutation 0.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 8 unt; 0 nHn; 3 RR)
% Number of literals : 8 ( 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 : 9 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP144-1.p',unknown),
[] ).
cnf(4,plain,
equal(greatest_lower_bound(A,B),greatest_lower_bound(B,A)),
file('GRP144-1.p',unknown),
[] ).
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP144-1.p',unknown),
[] ).
cnf(10,plain,
equal(least_upper_bound(A,greatest_lower_bound(A,B)),A),
file('GRP144-1.p',unknown),
[] ).
cnf(16,plain,
~ equal(least_upper_bound(greatest_lower_bound(a,b),b),b),
file('GRP144-1.p',unknown),
[] ).
cnf(20,plain,
equal(least_upper_bound(greatest_lower_bound(A,B),A),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,5]),1]),
[iquote('para(10,5),flip(1)')] ).
cnf(26,plain,
~ equal(b,b),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,16]),20]),
[iquote('para(4,16),demod([20])')] ).
cnf(27,plain,
$false,
inference(conflict,[status(thm)],[26]),
[iquote('xx_conflict(26)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP144-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/0.12 % Command : tptp2X_and_run_eqp %s
% 0.11/0.32 % Computer : n020.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Mon Jun 13 05:27:05 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.75/1.15 ----- EQP 0.9e, May 2009 -----
% 0.75/1.15 The job began on n020.cluster.edu, Mon Jun 13 05:27:06 2022
% 0.75/1.15 The command was "./eqp09e".
% 0.75/1.15
% 0.75/1.15 set(prolog_style_variables).
% 0.75/1.15 set(lrpo).
% 0.75/1.15 set(basic_paramod).
% 0.75/1.15 set(functional_subsume).
% 0.75/1.15 set(ordered_paramod).
% 0.75/1.15 set(prime_paramod).
% 0.75/1.15 set(para_pairs).
% 0.75/1.15 assign(pick_given_ratio,4).
% 0.75/1.15 clear(print_kept).
% 0.75/1.15 clear(print_new_demod).
% 0.75/1.15 clear(print_back_demod).
% 0.75/1.15 clear(print_given).
% 0.75/1.15 assign(max_mem,64000).
% 0.75/1.15 end_of_commands.
% 0.75/1.15
% 0.75/1.15 Usable:
% 0.75/1.15 end_of_list.
% 0.75/1.15
% 0.75/1.15 Sos:
% 0.75/1.15 0 (wt=-1) [] multiply(identity,A) = A.
% 0.75/1.15 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.75/1.15 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.75/1.15 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.75/1.15 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.75/1.15 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.75/1.15 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.75/1.15 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.75/1.15 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.75/1.15 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.75/1.15 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.75/1.15 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.75/1.15 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.75/1.15 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.75/1.15 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.75/1.15 0 (wt=-1) [] -(least_upper_bound(greatest_lower_bound(a,b),b) = b).
% 0.75/1.15 end_of_list.
% 0.75/1.15
% 0.75/1.15 Demodulators:
% 0.75/1.15 end_of_list.
% 0.75/1.15
% 0.75/1.15 Passive:
% 0.75/1.15 end_of_list.
% 0.75/1.15
% 0.75/1.15 Starting to process input.
% 0.75/1.15
% 0.75/1.15 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.75/1.15 1 is a new demodulator.
% 0.75/1.15
% 0.75/1.15 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.75/1.15 2 is a new demodulator.
% 0.75/1.15
% 0.75/1.15 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.75/1.15 3 is a new demodulator.
% 0.75/1.15
% 0.75/1.15 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.75/1.15 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.75/1.15
% 0.75/1.15 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.75/1.15 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.75/1.15
% 0.75/1.15 ** 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.75/1.15 6 is a new demodulator.
% 0.75/1.15
% 0.75/1.15 ** 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.75/1.15 7 is a new demodulator.
% 0.75/1.15
% 0.75/1.15 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.75/1.15 8 is a new demodulator.
% 0.75/1.15
% 0.75/1.15 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.75/1.15 9 is a new demodulator.
% 0.75/1.15
% 0.75/1.15 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.75/1.15 10 is a new demodulator.
% 0.75/1.15
% 0.75/1.15 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.75/1.15 11 is a new demodulator.
% 0.75/1.15
% 0.75/1.15 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.75/1.15 12 is a new demodulator.
% 0.75/1.15
% 0.75/1.15 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.75/1.15 13 is a new demodulator.
% 0.75/1.15
% 0.75/1.15 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.75/1.15 14 is a new demodulator.
% 0.75/1.15
% 0.75/1.15 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.75/1.15 15 is a new demodulator.
% 0.75/1.15
% 0.75/1.15 ** KEPT: 16 (wt=7) [] -(least_upper_bound(greatest_lower_bound(a,b),b) = b).
% 0.75/1.15 ---------------- PROOF FOUND ----------------
% 0.75/1.15 % SZS status Unsatisfiable
% 0.75/1.15
% 0.75/1.15
% 0.75/1.15 After processing input:
% 0.75/1.15
% 0.75/1.15 Usable:
% 0.75/1.15 end_of_list.
% 0.75/1.15
% 0.75/1.15 Sos:
% 0.75/1.15 1 (wt=5) [] multiply(identity,A) = A.
% 0.75/1.15 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.75/1.15 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.75/1.15 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.75/1.15 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.75/1.15 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.75/1.15 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.75/1.15 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.75/1.15 16 (wt=7) [] -(least_upper_bound(greatest_lower_bound(a,b),b) = b).
% 0.75/1.15 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.75/1.15 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.75/1.15 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.75/1.15 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.75/1.15 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.75/1.15 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.75/1.15 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.75/1.15 end_of_list.
% 0.75/1.15
% 0.75/1.15 Demodulators:
% 0.75/1.15 1 (wt=5) [] multiply(identity,A) = A.
% 0.75/1.15 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.75/1.15 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.75/1.15 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.75/1.15 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.75/1.15 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.75/1.15 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.75/1.15 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.75/1.15 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.75/1.15 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.75/1.15 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.75/1.15 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.75/1.15 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.75/1.15 end_of_list.
% 0.75/1.15
% 0.75/1.15 Passive:
% 0.75/1.15 end_of_list.
% 0.75/1.15
% 0.75/1.15 UNIT CONFLICT from 26 and x=x at 0.00 seconds.
% 0.75/1.15
% 0.75/1.15 ---------------- PROOF ----------------
% 0.75/1.15 % SZS output start Refutation
% See solution above
% 0.75/1.15 ------------ end of proof -------------
% 0.75/1.15
% 0.75/1.15
% 0.75/1.15 ------------- memory usage ------------
% 0.75/1.15 Memory dynamically allocated (tp_alloc): 488.
% 0.75/1.15 type (bytes each) gets frees in use avail bytes
% 0.75/1.15 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.75/1.15 term ( 16) 1674 1451 223 20 4.6 K
% 0.75/1.15 gen_ptr ( 8) 884 263 621 7 4.9 K
% 0.75/1.15 context ( 808) 723 721 2 3 3.9 K
% 0.75/1.15 trail ( 12) 61 61 0 3 0.0 K
% 0.75/1.15 bt_node ( 68) 291 288 3 2 0.3 K
% 0.75/1.15 ac_position (285432) 0 0 0 0 0.0 K
% 0.75/1.15 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.75/1.15 ac_match_free_vars_pos (4020)
% 0.75/1.15 0 0 0 0 0.0 K
% 0.75/1.15 discrim ( 12) 212 0 212 0 2.5 K
% 0.75/1.15 flat ( 40) 749 749 0 11 0.4 K
% 0.75/1.15 discrim_pos ( 12) 28 28 0 1 0.0 K
% 0.75/1.15 fpa_head ( 12) 169 0 169 0 2.0 K
% 0.75/1.15 fpa_tree ( 28) 27 27 0 5 0.1 K
% 0.75/1.15 fpa_pos ( 36) 44 44 0 1 0.0 K
% 0.75/1.15 literal ( 12) 83 57 26 0 0.3 K
% 0.75/1.15 clause ( 24) 83 57 26 0 0.6 K
% 0.75/1.15 list ( 12) 78 22 56 3 0.7 K
% 0.75/1.15 list_pos ( 20) 110 16 94 0 1.8 K
% 0.75/1.15 pair_index ( 40) 2 0 2 0 0.1 K
% 0.75/1.15
% 0.75/1.15 -------------- statistics -------------
% 0.75/1.15 Clauses input 16
% 0.75/1.15 Usable input 0
% 0.75/1.15 Sos input 16
% 0.75/1.15 Demodulators input 0
% 0.75/1.15 Passive input 0
% 0.75/1.15
% 0.75/1.15 Processed BS (before search) 18
% 0.75/1.15 Forward subsumed BS 2
% 0.75/1.15 Kept BS 16
% 0.75/1.15 New demodulators BS 13
% 0.75/1.15 Back demodulated BS 0
% 0.75/1.15
% 0.75/1.15 Clauses or pairs given 86
% 0.75/1.15 Clauses generated 37
% 0.75/1.15 Forward subsumed 27
% 0.75/1.15 Deleted by weight 0
% 0.75/1.15 Deleted by variable count 0
% 0.75/1.15 Kept 10
% 0.75/1.15 New demodulators 6
% 0.75/1.15 Back demodulated 0
% 0.75/1.15 Ordered paramod prunes 0
% 0.75/1.15 Basic paramod prunes 41
% 0.75/1.15 Prime paramod prunes 0
% 0.75/1.15 Semantic prunes 0
% 0.75/1.15
% 0.75/1.15 Rewrite attmepts 232
% 0.75/1.15 Rewrites 24
% 0.75/1.15
% 0.75/1.15 FPA overloads 0
% 0.75/1.15 FPA underloads 0
% 0.75/1.15
% 0.75/1.15 Usable size 0
% 0.75/1.15 Sos size 25
% 0.75/1.15 Demodulators size 19
% 0.75/1.15 Passive size 0
% 0.75/1.15 Disabled size 0
% 0.75/1.15
% 0.75/1.15 Proofs found 1
% 0.75/1.15
% 0.75/1.15 ----------- times (seconds) ----------- Mon Jun 13 05:27:06 2022
% 0.75/1.15
% 0.75/1.15 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.75/1.15 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.75/1.15 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.75/1.15 input time 0.00
% 0.75/1.15 paramodulation time 0.00
% 0.75/1.15 demodulation time 0.00
% 0.75/1.15 orient time 0.00
% 0.75/1.15 weigh time 0.00
% 0.75/1.15 forward subsume time 0.00
% 0.75/1.15 back demod find time 0.00
% 0.75/1.15 conflict time 0.00
% 0.75/1.15 LRPO time 0.00
% 0.75/1.15 store clause time 0.00
% 0.75/1.15 disable clause time 0.00
% 0.75/1.15 prime paramod time 0.00
% 0.75/1.15 semantics time 0.00
% 0.75/1.15
% 0.75/1.15 EQP interrupted
%------------------------------------------------------------------------------