TSTP Solution File: GRP141-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP141-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:30 EDT 2022
% Result : Unsatisfiable 0.43s 1.06s
% Output : Refutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 11 RR)
% Number of literals : 16 ( 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP141-1.p',unknown),
[] ).
cnf(4,plain,
equal(greatest_lower_bound(A,B),greatest_lower_bound(B,A)),
file('GRP141-1.p',unknown),
[] ).
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP141-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(11,plain,
equal(greatest_lower_bound(A,least_upper_bound(A,B)),A),
file('GRP141-1.p',unknown),
[] ).
cnf(16,plain,
equal(least_upper_bound(a,c),a),
file('GRP141-1.p',unknown),
[] ).
cnf(17,plain,
equal(least_upper_bound(b,c),b),
file('GRP141-1.p',unknown),
[] ).
cnf(18,plain,
~ equal(greatest_lower_bound(a,greatest_lower_bound(b,c)),c),
inference(demod,[status(thm),theory(equality)],[6]),
[iquote('demod([6])')] ).
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(27,plain,
equal(greatest_lower_bound(a,c),c),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,4]),1]),
[iquote('para(22,4),flip(1)')] ).
cnf(31,plain,
equal(greatest_lower_bound(b,c),c),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,4]),1]),
[iquote('para(26,4),flip(1)')] ).
cnf(32,plain,
~ equal(c,c),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[18]),31,27]),
[iquote('back_demod(18),demod([31,27])')] ).
cnf(33,plain,
$false,
inference(conflict,[status(thm)],[32]),
[iquote('xx_conflict(32)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP141-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 14 02:15:10 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.43/1.06 ----- EQP 0.9e, May 2009 -----
% 0.43/1.06 The job began on n029.cluster.edu, Tue Jun 14 02:15:11 2022
% 0.43/1.06 The command was "./eqp09e".
% 0.43/1.06
% 0.43/1.06 set(prolog_style_variables).
% 0.43/1.06 set(lrpo).
% 0.43/1.06 set(basic_paramod).
% 0.43/1.06 set(functional_subsume).
% 0.43/1.06 set(ordered_paramod).
% 0.43/1.06 set(prime_paramod).
% 0.43/1.06 set(para_pairs).
% 0.43/1.06 assign(pick_given_ratio,4).
% 0.43/1.06 clear(print_kept).
% 0.43/1.06 clear(print_new_demod).
% 0.43/1.06 clear(print_back_demod).
% 0.43/1.06 clear(print_given).
% 0.43/1.06 assign(max_mem,64000).
% 0.43/1.06 end_of_commands.
% 0.43/1.06
% 0.43/1.06 Usable:
% 0.43/1.06 end_of_list.
% 0.43/1.06
% 0.43/1.06 Sos:
% 0.43/1.06 0 (wt=-1) [] multiply(identity,A) = A.
% 0.43/1.06 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.43/1.06 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.06 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.43/1.06 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.43/1.06 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.43/1.06 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.43/1.06 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.43/1.06 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.43/1.06 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.43/1.06 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.43/1.06 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.06 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.06 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.06 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.06 0 (wt=-1) [] least_upper_bound(a,c) = a.
% 0.43/1.06 0 (wt=-1) [] least_upper_bound(b,c) = b.
% 0.43/1.06 0 (wt=-1) [] -(greatest_lower_bound(greatest_lower_bound(a,b),c) = c).
% 0.43/1.06 end_of_list.
% 0.43/1.06
% 0.43/1.06 Demodulators:
% 0.43/1.06 end_of_list.
% 0.43/1.06
% 0.43/1.06 Passive:
% 0.43/1.06 end_of_list.
% 0.43/1.06
% 0.43/1.06 Starting to process input.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.43/1.06 1 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.43/1.06 2 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.06 3 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.43/1.06 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.43/1.06
% 0.43/1.06 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.43/1.06 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.43/1.06
% 0.43/1.06 ** 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.06 6 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** 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.06 7 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.43/1.06 8 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.43/1.06 9 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.43/1.06 10 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.43/1.06 11 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.06 12 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.06 13 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.06 14 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.06 15 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 16 (wt=5) [] least_upper_bound(a,c) = a.
% 0.43/1.06 16 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 17 (wt=5) [] least_upper_bound(b,c) = b.
% 0.43/1.06 17 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 18 (wt=7) [demod([6])] -(greatest_lower_bound(a,greatest_lower_bound(b,c)) = c).
% 0.43/1.06 ---------------- PROOF FOUND ----------------
% 0.43/1.06 % SZS status Unsatisfiable
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 After processing input:
% 0.43/1.06
% 0.43/1.06 Usable:
% 0.43/1.06 end_of_list.
% 0.43/1.06
% 0.43/1.06 Sos:
% 0.43/1.06 1 (wt=5) [] multiply(identity,A) = A.
% 0.43/1.06 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.43/1.06 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.43/1.06 16 (wt=5) [] least_upper_bound(a,c) = a.
% 0.43/1.06 17 (wt=5) [] least_upper_bound(b,c) = b.
% 0.43/1.06 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.43/1.06 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.43/1.06 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.43/1.06 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.43/1.06 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.43/1.06 18 (wt=7) [demod([6])] -(greatest_lower_bound(a,greatest_lower_bound(b,c)) = c).
% 0.43/1.06 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.06 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.06 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.06 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.06 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.06 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.06 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.06 end_of_list.
% 0.43/1.06
% 0.43/1.06 Demodulators:
% 0.43/1.06 1 (wt=5) [] multiply(identity,A) = A.
% 0.43/1.06 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.43/1.06 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.06 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.06 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.06 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.43/1.06 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.43/1.06 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.43/1.06 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.43/1.06 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.06 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.06 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.06 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.06 16 (wt=5) [] least_upper_bound(a,c) = a.
% 0.43/1.06 17 (wt=5) [] least_upper_bound(b,c) = b.
% 0.43/1.06 end_of_list.
% 0.43/1.06
% 0.43/1.06 Passive:
% 0.43/1.06 end_of_list.
% 0.43/1.06
% 0.43/1.06 UNIT CONFLICT from 32 and x=x at 0.00 seconds.
% 0.43/1.06
% 0.43/1.06 ---------------- PROOF ----------------
% 0.43/1.06 % SZS output start Refutation
% See solution above
% 0.43/1.06 ------------ end of proof -------------
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 ------------- memory usage ------------
% 0.43/1.06 Memory dynamically allocated (tp_alloc): 488.
% 0.43/1.06 type (bytes each) gets frees in use avail bytes
% 0.43/1.06 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.43/1.06 term ( 16) 1968 1706 262 15 5.3 K
% 0.43/1.06 gen_ptr ( 8) 1075 323 752 15 6.0 K
% 0.43/1.06 context ( 808) 1166 1164 2 3 3.9 K
% 0.43/1.06 trail ( 12) 44 44 0 3 0.0 K
% 0.43/1.06 bt_node ( 68) 481 478 3 2 0.3 K
% 0.43/1.06 ac_position (285432) 0 0 0 0 0.0 K
% 0.43/1.06 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.43/1.06 ac_match_free_vars_pos (4020)
% 0.43/1.06 0 0 0 0 0.0 K
% 0.43/1.06 discrim ( 12) 229 7 222 7 2.7 K
% 0.43/1.06 flat ( 40) 1052 1052 0 11 0.4 K
% 0.43/1.06 discrim_pos ( 12) 40 40 0 1 0.0 K
% 0.43/1.06 fpa_head ( 12) 182 0 182 0 2.1 K
% 0.43/1.06 fpa_tree ( 28) 49 49 0 5 0.1 K
% 0.43/1.06 fpa_pos ( 36) 53 53 0 1 0.0 K
% 0.43/1.06 literal ( 12) 106 74 32 0 0.4 K
% 0.43/1.06 clause ( 24) 106 74 32 0 0.8 K
% 0.43/1.06 list ( 12) 81 24 57 2 0.7 K
% 0.43/1.06 list_pos ( 20) 135 22 113 3 2.3 K
% 0.43/1.06 pair_index ( 40) 2 0 2 0 0.1 K
% 0.43/1.06
% 0.43/1.06 -------------- statistics -------------
% 0.43/1.06 Clauses input 18
% 0.43/1.06 Usable input 0
% 0.43/1.06 Sos input 18
% 0.43/1.06 Demodulators input 0
% 0.43/1.06 Passive input 0
% 0.43/1.06
% 0.43/1.06 Processed BS (before search) 20
% 0.43/1.06 Forward subsumed BS 2
% 0.43/1.06 Kept BS 18
% 0.43/1.06 New demodulators BS 15
% 0.43/1.06 Back demodulated BS 0
% 0.43/1.06
% 0.43/1.06 Clauses or pairs given 131
% 0.43/1.06 Clauses generated 50
% 0.43/1.06 Forward subsumed 36
% 0.43/1.06 Deleted by weight 0
% 0.43/1.06 Deleted by variable count 0
% 0.43/1.06 Kept 14
% 0.43/1.06 New demodulators 7
% 0.43/1.06 Back demodulated 1
% 0.43/1.06 Ordered paramod prunes 0
% 0.43/1.06 Basic paramod prunes 116
% 0.43/1.06 Prime paramod prunes 0
% 0.43/1.06 Semantic prunes 0
% 0.43/1.06
% 0.43/1.06 Rewrite attmepts 352
% 0.43/1.06 Rewrites 34
% 0.43/1.06
% 0.43/1.06 FPA overloads 0
% 0.43/1.06 FPA underloads 0
% 0.43/1.06
% 0.43/1.06 Usable size 0
% 0.43/1.06 Sos size 30
% 0.43/1.06 Demodulators size 22
% 0.43/1.06 Passive size 0
% 0.43/1.06 Disabled size 1
% 0.43/1.06
% 0.43/1.06 Proofs found 1
% 0.43/1.06
% 0.43/1.06 ----------- times (seconds) ----------- Tue Jun 14 02:15:11 2022
% 0.43/1.06
% 0.43/1.06 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.43/1.06 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.43/1.06 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.43/1.06 input time 0.00
% 0.43/1.06 paramodulation time 0.00
% 0.43/1.06 demodulation time 0.00
% 0.43/1.06 orient time 0.00
% 0.43/1.06 weigh time 0.00
% 0.43/1.06 forward subsume time 0.00
% 0.43/1.06 back demod find time 0.00
% 0.43/1.06 conflict time 0.00
% 0.43/1.06 LRPO time 0.00
% 0.43/1.06 store clause time 0.00
% 0.43/1.06 disable clause time 0.00
% 0.43/1.06 prime paramod time 0.00
% 0.43/1.06 semantics time 0.00
% 0.43/1.06
% 0.43/1.06 EQP interrupted
%------------------------------------------------------------------------------