TSTP Solution File: GRP156-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP156-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n003.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:33 EDT 2022
% Result : Unsatisfiable 0.43s 1.07s
% Output : Refutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 8 unt; 0 nHn; 4 RR)
% Number of literals : 8 ( 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 : 7 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP156-1.p',unknown),
[] ).
cnf(11,plain,
equal(greatest_lower_bound(A,least_upper_bound(A,B)),A),
file('GRP156-1.p',unknown),
[] ).
cnf(15,plain,
equal(multiply(greatest_lower_bound(A,B),C),greatest_lower_bound(multiply(A,C),multiply(B,C))),
file('GRP156-1.p',unknown),
[] ).
cnf(16,plain,
equal(least_upper_bound(a,b),b),
file('GRP156-1.p',unknown),
[] ).
cnf(17,plain,
~ equal(greatest_lower_bound(multiply(a,c),multiply(b,c)),multiply(a,c)),
file('GRP156-1.p',unknown),
[] ).
cnf(20,plain,
equal(greatest_lower_bound(a,b),a),
inference(para,[status(thm),theory(equality)],[16,11]),
[iquote('para(16,11)')] ).
cnf(78,plain,
equal(greatest_lower_bound(multiply(a,A),multiply(b,A)),multiply(a,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,15]),1]),
[iquote('para(20,15),flip(1)')] ).
cnf(79,plain,
$false,
inference(conflict,[status(thm)],[78,17]),
[iquote('conflict(78,17)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP156-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n003.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 : Tue Jun 14 13:29:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/1.07 ----- EQP 0.9e, May 2009 -----
% 0.43/1.07 The job began on n003.cluster.edu, Tue Jun 14 13:29:56 2022
% 0.43/1.07 The command was "./eqp09e".
% 0.43/1.07
% 0.43/1.07 set(prolog_style_variables).
% 0.43/1.07 set(lrpo).
% 0.43/1.07 set(basic_paramod).
% 0.43/1.07 set(functional_subsume).
% 0.43/1.07 set(ordered_paramod).
% 0.43/1.07 set(prime_paramod).
% 0.43/1.07 set(para_pairs).
% 0.43/1.07 assign(pick_given_ratio,4).
% 0.43/1.07 clear(print_kept).
% 0.43/1.07 clear(print_new_demod).
% 0.43/1.07 clear(print_back_demod).
% 0.43/1.07 clear(print_given).
% 0.43/1.07 assign(max_mem,64000).
% 0.43/1.07 end_of_commands.
% 0.43/1.07
% 0.43/1.07 Usable:
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Sos:
% 0.43/1.07 0 (wt=-1) [] multiply(identity,A) = A.
% 0.43/1.07 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.43/1.07 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.07 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.43/1.07 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.43/1.07 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.43/1.07 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.43/1.07 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.43/1.07 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.43/1.07 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.43/1.07 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.43/1.07 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 0 (wt=-1) [] least_upper_bound(a,b) = b.
% 0.43/1.07 0 (wt=-1) [] -(greatest_lower_bound(multiply(a,c),multiply(b,c)) = multiply(a,c)).
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Demodulators:
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Passive:
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Starting to process input.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.43/1.07 1 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.43/1.07 2 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.07 3 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.43/1.07 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.43/1.07
% 0.43/1.07 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.43/1.07 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.43/1.07
% 0.43/1.07 ** 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.07 6 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** 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.07 7 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.43/1.07 8 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.43/1.07 9 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.43/1.07 10 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.43/1.07 11 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 12 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 13 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 14 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 15 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 16 (wt=5) [] least_upper_bound(a,b) = b.
% 0.43/1.07 16 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 17 (wt=11) [] -(greatest_lower_bound(multiply(a,c),multiply(b,c)) = multiply(a,c)).
% 0.43/1.07 ---------------- PROOF FOUND ----------------
% 0.43/1.07 % SZS status Unsatisfiable
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 After processing input:
% 0.43/1.07
% 0.43/1.07 Usable:
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Sos:
% 0.43/1.07 1 (wt=5) [] multiply(identity,A) = A.
% 0.43/1.07 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.43/1.07 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.43/1.07 16 (wt=5) [] least_upper_bound(a,b) = b.
% 0.43/1.07 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.43/1.07 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.43/1.07 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.43/1.07 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.43/1.07 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.43/1.07 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.07 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.07 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.07 17 (wt=11) [] -(greatest_lower_bound(multiply(a,c),multiply(b,c)) = multiply(a,c)).
% 0.43/1.07 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Demodulators:
% 0.43/1.07 1 (wt=5) [] multiply(identity,A) = A.
% 0.43/1.07 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.43/1.07 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.07 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.07 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.07 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.43/1.07 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.43/1.07 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.43/1.07 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.43/1.07 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 16 (wt=5) [] least_upper_bound(a,b) = b.
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Passive:
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 UNIT CONFLICT from 78 and 17 at 0.01 seconds.
% 0.43/1.07
% 0.43/1.07 ---------------- PROOF ----------------
% 0.43/1.07 % SZS output start Refutation
% See solution above
% 0.43/1.07 ------------ end of proof -------------
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 ------------- memory usage ------------
% 0.43/1.07 Memory dynamically allocated (tp_alloc): 488.
% 0.43/1.07 type (bytes each) gets frees in use avail bytes
% 0.43/1.07 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.43/1.07 term ( 16) 5667 4888 779 14 15.2 K
% 0.43/1.07 gen_ptr ( 8) 3873 1330 2543 7 19.9 K
% 0.43/1.07 context ( 808) 5329 5327 2 3 3.9 K
% 0.43/1.07 trail ( 12) 231 231 0 4 0.0 K
% 0.43/1.07 bt_node ( 68) 2383 2380 3 3 0.4 K
% 0.43/1.07 ac_position (285432) 0 0 0 0 0.0 K
% 0.43/1.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.43/1.07 ac_match_free_vars_pos (4020)
% 0.43/1.07 0 0 0 0 0.0 K
% 0.43/1.07 discrim ( 12) 746 47 699 0 8.2 K
% 0.43/1.07 flat ( 40) 5657 5657 0 13 0.5 K
% 0.43/1.07 discrim_pos ( 12) 296 296 0 1 0.0 K
% 0.43/1.07 fpa_head ( 12) 475 0 475 0 5.6 K
% 0.43/1.07 fpa_tree ( 28) 151 151 0 7 0.2 K
% 0.43/1.07 fpa_pos ( 36) 144 144 0 1 0.0 K
% 0.43/1.07 literal ( 12) 370 292 78 1 0.9 K
% 0.43/1.07 clause ( 24) 370 292 78 1 1.9 K
% 0.43/1.07 list ( 12) 125 69 56 3 0.7 K
% 0.43/1.07 list_pos ( 20) 328 52 276 0 5.4 K
% 0.43/1.07 pair_index ( 40) 2 0 2 0 0.1 K
% 0.43/1.07
% 0.43/1.07 -------------- statistics -------------
% 0.43/1.07 Clauses input 17
% 0.43/1.07 Usable input 0
% 0.43/1.07 Sos input 17
% 0.43/1.07 Demodulators input 0
% 0.43/1.07 Passive input 0
% 0.43/1.07
% 0.43/1.07 Processed BS (before search) 19
% 0.43/1.07 Forward subsumed BS 2
% 0.43/1.07 Kept BS 17
% 0.43/1.07 New demodulators BS 14
% 0.43/1.07 Back demodulated BS 0
% 0.43/1.07
% 0.43/1.07 Clauses or pairs given 690
% 0.43/1.07 Clauses generated 243
% 0.43/1.07 Forward subsumed 182
% 0.43/1.07 Deleted by weight 0
% 0.43/1.07 Deleted by variable count 0
% 0.43/1.07 Kept 61
% 0.43/1.07 New demodulators 52
% 0.43/1.07 Back demodulated 7
% 0.43/1.07 Ordered paramod prunes 0
% 0.43/1.07 Basic paramod prunes 944
% 0.43/1.07 Prime paramod prunes 4
% 0.43/1.07 Semantic prunes 0
% 0.43/1.07
% 0.43/1.07 Rewrite attmepts 1602
% 0.43/1.07 Rewrites 277
% 0.43/1.07
% 0.43/1.07 FPA overloads 0
% 0.43/1.07 FPA underloads 0
% 0.43/1.07
% 0.43/1.07 Usable size 0
% 0.43/1.07 Sos size 70
% 0.43/1.07 Demodulators size 59
% 0.43/1.07 Passive size 0
% 0.43/1.07 Disabled size 7
% 0.43/1.07
% 0.43/1.07 Proofs found 1
% 0.43/1.07
% 0.43/1.07 ----------- times (seconds) ----------- Tue Jun 14 13:29:56 2022
% 0.43/1.07
% 0.43/1.07 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.43/1.07 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.43/1.07 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.43/1.07 input time 0.00
% 0.43/1.07 paramodulation time 0.00
% 0.43/1.07 demodulation time 0.00
% 0.43/1.07 orient time 0.00
% 0.43/1.07 weigh time 0.00
% 0.43/1.07 forward subsume time 0.00
% 0.43/1.07 back demod find time 0.00
% 0.43/1.07 conflict time 0.00
% 0.43/1.07 LRPO time 0.00
% 0.43/1.07 store clause time 0.00
% 0.43/1.07 disable clause time 0.00
% 0.43/1.07 prime paramod time 0.00
% 0.43/1.07 semantics time 0.00
% 0.43/1.07
% 0.43/1.07 EQP interrupted
%------------------------------------------------------------------------------