TSTP Solution File: RNG007-4 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG007-4 : TPTP v8.1.0. Released v1.0.0.
% 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 : Mon Jul 18 20:25:29 EDT 2022
% Result : Unsatisfiable 0.41s 1.05s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 2 RR)
% Number of literals : 11 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(additive_identity,A),A),
file('RNG007-4.p',unknown),
[] ).
cnf(2,plain,
equal(add(additive_inverse(A),A),additive_identity),
file('RNG007-4.p',unknown),
[] ).
cnf(6,plain,
equal(additive_inverse(additive_inverse(A)),A),
file('RNG007-4.p',unknown),
[] ).
cnf(10,plain,
equal(additive_inverse(multiply(A,B)),multiply(A,additive_inverse(B))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(11,plain,
equal(multiply(additive_inverse(A),B),multiply(A,additive_inverse(B))),
inference(demod,[status(thm),theory(equality)],[10]),
[iquote('demod([10])')] ).
cnf(16,plain,
equal(multiply(A,A),A),
file('RNG007-4.p',unknown),
[] ).
cnf(17,plain,
~ equal(add(a,a),additive_identity),
file('RNG007-4.p',unknown),
[] ).
cnf(19,plain,
equal(add(A,additive_inverse(A)),additive_identity),
inference(para,[status(thm),theory(equality)],[6,2]),
[iquote('para(6,2)')] ).
cnf(28,plain,
equal(additive_inverse(A),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,16]),6,16]),1]),
[iquote('para(11,16),demod([6,16]),flip(1)')] ).
cnf(31,plain,
equal(add(A,A),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[19]),28]),
[iquote('back_demod(19),demod([28])')] ).
cnf(32,plain,
$false,
inference(conflict,[status(thm)],[31,17]),
[iquote('conflict(31,17)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG007-4 : TPTP v8.1.0. Released v1.0.0.
% 0.12/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 May 30 05:04:58 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 May 30 05:04:59 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) [] add(additive_identity,A) = A.
% 0.41/1.05 0 (wt=-1) [] add(additive_inverse(A),A) = additive_identity.
% 0.41/1.05 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.41/1.05 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.41/1.05 0 (wt=-1) [] additive_inverse(additive_identity) = additive_identity.
% 0.41/1.05 0 (wt=-1) [] additive_inverse(additive_inverse(A)) = A.
% 0.41/1.05 0 (wt=-1) [] multiply(A,additive_identity) = additive_identity.
% 0.41/1.05 0 (wt=-1) [] multiply(additive_identity,A) = additive_identity.
% 0.41/1.05 0 (wt=-1) [] additive_inverse(add(A,B)) = add(additive_inverse(A),additive_inverse(B)).
% 0.41/1.05 0 (wt=-1) [] multiply(A,additive_inverse(B)) = additive_inverse(multiply(A,B)).
% 0.41/1.05 0 (wt=-1) [] multiply(additive_inverse(A),B) = additive_inverse(multiply(A,B)).
% 0.41/1.05 0 (wt=-1) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.41/1.05 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.41/1.05 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.41/1.05 0 (wt=-1) [] multiply(A,A) = A.
% 0.41/1.05 0 (wt=-1) [] -(add(a,a) = additive_identity).
% 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) [] add(additive_identity,A) = A.
% 0.41/1.05 1 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 2 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.41/1.05 2 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 3 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.41/1.05 3 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 4 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.41/1.05 4 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 5 (wt=4) [] additive_inverse(additive_identity) = additive_identity.
% 0.41/1.05 5 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 6 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.41/1.05 6 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 7 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.41/1.05 7 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 8 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.41/1.05 8 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 9 (wt=10) [] additive_inverse(add(A,B)) = add(additive_inverse(A),additive_inverse(B)).
% 0.41/1.05 9 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 10 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(A,additive_inverse(B)).
% 0.41/1.05 10 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 11 (wt=9) [demod([10])] multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)).
% 0.41/1.05
% 0.41/1.05 ** KEPT: 12 (wt=9) [flip(11)] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 0.41/1.05 clause forward subsumed: 0 (wt=9) [flip(12)] multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)).
% 0.41/1.05
% 0.41/1.05 ** KEPT: 13 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.41/1.05 13 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 14 (wt=7) [] add(A,B) = add(B,A).
% 0.41/1.05 clause forward subsumed: 0 (wt=7) [flip(14)] add(B,A) = add(A,B).
% 0.41/1.05
% 0.41/1.05 ** KEPT: 15 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.41/1.05 15 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 16 (wt=5) [] multiply(A,A) = A.
% 0.41/1.05 16 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 17 (wt=5) [] -(add(a,a) = additive_identity).
% 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 After processing input:
% 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 5 (wt=4) [] additive_inverse(additive_identity) = additive_identity.
% 0.41/1.05 1 (wt=5) [] add(additive_identity,A) = A.
% 0.41/1.05 6 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.41/1.05 7 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.41/1.05 8 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.41/1.05 16 (wt=5) [] multiply(A,A) = A.
% 0.41/1.05 17 (wt=5) [] -(add(a,a) = additive_identity).
% 0.41/1.05 2 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.41/1.05 14 (wt=7) [] add(A,B) = add(B,A).
% 0.41/1.05 10 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(A,additive_inverse(B)).
% 0.41/1.05 11 (wt=9) [demod([10])] multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)).
% 0.41/1.05 12 (wt=9) [flip(11)] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 0.41/1.05 9 (wt=10) [] additive_inverse(add(A,B)) = add(additive_inverse(A),additive_inverse(B)).
% 0.41/1.05 13 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.41/1.05 15 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.41/1.05 3 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.41/1.05 4 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.41/1.05 end_of_list.
% 0.41/1.05
% 0.41/1.05 Demodulators:
% 0.41/1.05 1 (wt=5) [] add(additive_identity,A) = A.
% 0.41/1.05 2 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.41/1.05 3 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.41/1.05 4 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.41/1.05 5 (wt=4) [] additive_inverse(additive_identity) = additive_identity.
% 0.41/1.05 6 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.41/1.05 7 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.41/1.05 8 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.41/1.05 9 (wt=10) [] additive_inverse(add(A,B)) = add(additive_inverse(A),additive_inverse(B)).
% 0.41/1.05 10 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(A,additive_inverse(B)).
% 0.41/1.05 13 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.41/1.05 15 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.41/1.05 16 (wt=5) [] multiply(A,A) = A.
% 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 UNIT CONFLICT from 31 and 17 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) 56 0 56 0 5.2 K
% 0.41/1.05 term ( 16) 1890 1601 289 11 5.7 K
% 0.41/1.05 gen_ptr ( 8) 1362 438 924 10 7.3 K
% 0.41/1.05 context ( 808) 1203 1201 2 2 3.2 K
% 0.41/1.05 trail ( 12) 111 111 0 3 0.0 K
% 0.41/1.05 bt_node ( 68) 432 429 3 2 0.3 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) 281 48 233 29 3.1 K
% 0.41/1.05 flat ( 40) 1236 1236 0 31 1.2 K
% 0.41/1.05 discrim_pos ( 12) 71 71 0 1 0.0 K
% 0.41/1.05 fpa_head ( 12) 191 0 191 0 2.2 K
% 0.41/1.05 fpa_tree ( 28) 46 46 0 7 0.2 K
% 0.41/1.05 fpa_pos ( 36) 55 55 0 1 0.0 K
% 0.41/1.05 literal ( 12) 112 81 31 1 0.4 K
% 0.41/1.05 clause ( 24) 112 81 31 1 0.8 K
% 0.41/1.05 list ( 12) 83 26 57 2 0.7 K
% 0.41/1.05 list_pos ( 20) 150 46 104 16 2.3 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) 19
% 0.41/1.05 Forward subsumed BS 2
% 0.41/1.05 Kept BS 17
% 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 127
% 0.41/1.05 Clauses generated 58
% 0.41/1.05 Forward subsumed 44
% 0.41/1.05 Deleted by weight 0
% 0.41/1.05 Deleted by variable count 0
% 0.41/1.05 Kept 14
% 0.41/1.05 New demodulators 11
% 0.41/1.05 Back demodulated 6
% 0.41/1.05 Ordered paramod prunes 0
% 0.41/1.05 Basic paramod prunes 40
% 0.41/1.05 Prime paramod prunes 4
% 0.41/1.05 Semantic prunes 0
% 0.41/1.05
% 0.41/1.05 Rewrite attmepts 422
% 0.41/1.05 Rewrites 64
% 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 24
% 0.41/1.05 Demodulators size 18
% 0.41/1.05 Passive size 0
% 0.41/1.05 Disabled size 6
% 0.41/1.05
% 0.41/1.05 Proofs found 1
% 0.41/1.05
% 0.41/1.05 ----------- times (seconds) ----------- Mon May 30 05:04:59 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
%------------------------------------------------------------------------------