TSTP Solution File: GRP161-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP161-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n029.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:35 EDT 2022
% Result : Unsatisfiable 0.41s 1.05s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 1
% Syntax : Number of clauses : 3 ( 3 unt; 0 nHn; 2 RR)
% Number of literals : 3 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 1 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(9,plain,
equal(greatest_lower_bound(A,A),A),
file('GRP161-1.p',unknown),
[] ).
cnf(16,plain,
~ equal(a,a),
inference(demod,[status(thm),theory(equality)],[9]),
[iquote('demod([9])')] ).
cnf(17,plain,
$false,
inference(conflict,[status(thm)],[16]),
[iquote('xx_conflict(16)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP161-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n029.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 09:53:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.05 ----- EQP 0.9e, May 2009 -----
% 0.41/1.05 The job began on n029.cluster.edu, Mon Jun 13 09:53:55 2022
% 0.41/1.05 The command was "./eqp09e".
% 0.41/1.05
% 0.41/1.05 set(prolog_style_variables).
% 0.41/1.05 set(lrpo).
% 0.41/1.05 set(basic_paramod).
% 0.41/1.05 set(functional_subsume).
% 0.41/1.05 set(ordered_paramod).
% 0.41/1.05 set(prime_paramod).
% 0.41/1.05 set(para_pairs).
% 0.41/1.05 assign(pick_given_ratio,4).
% 0.41/1.05 clear(print_kept).
% 0.41/1.05 clear(print_new_demod).
% 0.41/1.05 clear(print_back_demod).
% 0.41/1.05 clear(print_given).
% 0.41/1.05 assign(max_mem,64000).
% 0.41/1.05 end_of_commands.
% 0.41/1.05
% 0.41/1.05 Usable:
% 0.41/1.05 end_of_list.
% 0.41/1.05
% 0.41/1.05 Sos:
% 0.41/1.05 0 (wt=-1) [] multiply(identity,A) = A.
% 0.41/1.05 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.41/1.05 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.41/1.05 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.41/1.05 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.41/1.05 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.41/1.05 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.41/1.05 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.41/1.05 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.41/1.05 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.41/1.05 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.41/1.05 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.41/1.05 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.41/1.05 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.41/1.05 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.41/1.05 0 (wt=-1) [] -(greatest_lower_bound(a,a) = a).
% 0.41/1.05 end_of_list.
% 0.41/1.05
% 0.41/1.05 Demodulators:
% 0.41/1.05 end_of_list.
% 0.41/1.05
% 0.41/1.05 Passive:
% 0.41/1.05 end_of_list.
% 0.41/1.05
% 0.41/1.05 Starting to process input.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.41/1.05 1 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.41/1.05 2 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.41/1.05 3 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.41/1.05 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.41/1.05
% 0.41/1.05 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.41/1.05 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.41/1.05
% 0.41/1.05 ** 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.41/1.05 6 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** 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.41/1.05 7 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.41/1.05 8 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.41/1.05 9 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.41/1.05 10 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.41/1.05 11 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.41/1.05 12 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.41/1.05 13 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.41/1.05 14 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.41/1.05 15 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 16 (wt=3) [demod([9])] -(a = a).
% 0.41/1.05 ---------------- PROOF FOUND ----------------
% 0.41/1.05 % SZS status Unsatisfiable
% 0.41/1.05
% 0.41/1.05
% 0.41/1.05 UNIT CONFLICT from 16 and x=x at 0.00 seconds.
% 0.41/1.05
% 0.41/1.05 ---------------- PROOF ----------------
% 0.41/1.05 % SZS output start Refutation
% See solution above
% 0.41/1.05 ------------ end of proof -------------
% 0.41/1.05
% 0.41/1.05
% 0.41/1.05 ------------- memory usage ------------
% 0.41/1.05 Memory dynamically allocated (tp_alloc): 488.
% 0.41/1.05 type (bytes each) gets frees in use avail bytes
% 0.41/1.05 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.41/1.05 term ( 16) 831 690 141 17 3.0 K
% 0.41/1.05 gen_ptr ( 8) 492 130 362 2 2.8 K
% 0.41/1.05 context ( 808) 136 136 0 2 1.6 K
% 0.41/1.05 trail ( 12) 41 41 0 3 0.0 K
% 0.41/1.05 bt_node ( 68) 1 1 0 1 0.1 K
% 0.41/1.05 ac_position (285432) 0 0 0 0 0.0 K
% 0.41/1.05 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.41/1.05 ac_match_free_vars_pos (4020)
% 0.41/1.05 0 0 0 0 0.0 K
% 0.41/1.05 discrim ( 12) 151 0 151 0 1.8 K
% 0.41/1.05 flat ( 40) 218 218 0 7 0.3 K
% 0.41/1.05 discrim_pos ( 12) 3 3 0 1 0.0 K
% 0.41/1.05 fpa_head ( 12) 134 0 134 0 1.6 K
% 0.41/1.05 fpa_tree ( 28) 13 13 0 1 0.0 K
% 0.41/1.05 fpa_pos ( 36) 28 28 0 1 0.0 K
% 0.41/1.05 literal ( 12) 35 19 16 2 0.2 K
% 0.41/1.05 clause ( 24) 35 19 16 2 0.4 K
% 0.41/1.05 list ( 12) 72 14 58 1 0.7 K
% 0.41/1.05 list_pos ( 20) 74 16 58 1 1.2 K
% 0.41/1.05 pair_index ( 40) 2 0 2 0 0.1 K
% 0.41/1.05
% 0.41/1.05 -------------- statistics -------------
% 0.41/1.05 Clauses input 16
% 0.41/1.05 Usable input 0
% 0.41/1.05 Sos input 16
% 0.41/1.05 Demodulators input 0
% 0.41/1.05 Passive input 0
% 0.41/1.05
% 0.41/1.05 Processed BS (before search) 18
% 0.41/1.05 Forward subsumed BS 2
% 0.41/1.05 Kept BS 16
% 0.41/1.05 New demodulators BS 13
% 0.41/1.05 Back demodulated BS 0
% 0.41/1.05
% 0.41/1.05 Clauses or pairs given 0
% 0.41/1.05 Clauses generated 0
% 0.41/1.05 Forward subsumed 0
% 0.41/1.05 Deleted by weight 0
% 0.41/1.05 Deleted by variable count 0
% 0.41/1.05 Kept 0
% 0.41/1.05 New demodulators 0
% 0.41/1.05 Back demodulated 0
% 0.41/1.05 Ordered paramod prunes 0
% 0.41/1.05 Basic paramod prunes 0
% 0.41/1.05 Prime paramod prunes 0
% 0.41/1.05 Semantic prunes 0
% 0.41/1.05
% 0.41/1.05 Rewrite attmepts 73
% 0.41/1.05 Rewrites 1
% 0.41/1.05
% 0.41/1.05 FPA overloads 0
% 0.41/1.05 FPA underloads 0
% 0.41/1.05
% 0.41/1.05 Usable size 0
% 0.41/1.05 Sos size 15
% 0.41/1.05 Demodulators size 13
% 0.41/1.05 Passive size 0
% 0.41/1.05 Disabled size 0
% 0.41/1.05
% 0.41/1.05 Proofs found 1
% 0.41/1.05
% 0.41/1.05 ----------- times (seconds) ----------- Mon Jun 13 09:53:55 2022
% 0.41/1.05
% 0.41/1.05 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.41/1.05 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.41/1.05 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.41/1.05 input time 0.00
% 0.41/1.05 paramodulation time 0.00
% 0.41/1.05 demodulation time 0.00
% 0.41/1.05 orient time 0.00
% 0.41/1.05 weigh time 0.00
% 0.41/1.05 forward subsume time 0.00
% 0.41/1.05 back demod find time 0.00
% 0.41/1.05 conflict time 0.00
% 0.41/1.05 LRPO time 0.00
% 0.41/1.05 store clause time 0.00
% 0.41/1.05 disable clause time 0.00
% 0.41/1.05 prime paramod time 0.00
% 0.41/1.05 semantics time 0.00
% 0.41/1.05
% 0.41/1.05 EQP interrupted
%------------------------------------------------------------------------------