TSTP Solution File: ROB004-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : ROB004-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n026.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:51:35 EDT 2022
% Result : Unsatisfiable 0.75s 1.14s
% Output : Refutation 0.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of clauses : 52 ( 52 unt; 0 nHn; 16 RR)
% Number of literals : 52 ( 0 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('ROB004-1.p',unknown),
[] ).
cnf(2,plain,
equal(add(add(A,B),C),add(A,add(B,C))),
file('ROB004-1.p',unknown),
[] ).
cnf(3,plain,
equal(negate(add(negate(add(A,B)),negate(add(A,negate(B))))),A),
file('ROB004-1.p',unknown),
[] ).
cnf(4,plain,
equal(negate(d),c),
file('ROB004-1.p',unknown),
[] ).
cnf(5,plain,
equal(add(c,d),d),
file('ROB004-1.p',unknown),
[] ).
cnf(6,plain,
equal(add(c,c),c),
file('ROB004-1.p',unknown),
[] ).
cnf(7,plain,
~ equal(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))),b),
file('ROB004-1.p',unknown),
[] ).
cnf(8,plain,
equal(add(d,c),d),
inference(para,[status(thm),theory(equality)],[1,5]),
[iquote('para(1,5)')] ).
cnf(12,plain,
equal(negate(add(negate(add(A,B)),negate(add(B,negate(A))))),B),
inference(para,[status(thm),theory(equality)],[1,3]),
[iquote('para(1,3)')] ).
cnf(16,plain,
equal(negate(add(negate(add(A,add(B,C))),negate(add(A,add(B,negate(C)))))),add(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,3]),2]),
[iquote('para(2,3),demod([2])')] ).
cnf(23,plain,
equal(negate(add(negate(add(A,d)),negate(add(A,c)))),A),
inference(para,[status(thm),theory(equality)],[4,3]),
[iquote('para(4,3)')] ).
cnf(27,plain,
~ equal(add(negate(add(negate(b),a)),negate(add(negate(a),negate(b)))),b),
inference(para,[status(thm),theory(equality)],[1,7]),
[iquote('para(1,7)')] ).
cnf(45,plain,
equal(negate(add(negate(add(d,d)),c)),d),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,23]),4]),
[iquote('para(8,23),demod([4])')] ).
cnf(48,plain,
equal(negate(add(negate(add(d,A)),negate(add(A,c)))),A),
inference(para,[status(thm),theory(equality)],[4,12]),
[iquote('para(4,12)')] ).
cnf(87,plain,
equal(negate(add(negate(add(A,c)),negate(add(A,d)))),A),
inference(para,[status(thm),theory(equality)],[1,23]),
[iquote('para(1,23)')] ).
cnf(89,plain,
equal(negate(add(negate(add(A,c)),negate(add(d,A)))),A),
inference(para,[status(thm),theory(equality)],[1,48]),
[iquote('para(1,48)')] ).
cnf(112,plain,
equal(add(A,c),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,16]),4,6,23]),1]),
[iquote('para(5,16),demod([4,6,23]),flip(1)')] ).
cnf(115,plain,
equal(negate(add(negate(A),negate(add(d,A)))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[89]),112]),
[iquote('back_demod(89),demod([112])')] ).
cnf(116,plain,
equal(negate(add(negate(A),negate(add(A,d)))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[87]),112]),
[iquote('back_demod(87),demod([112])')] ).
cnf(117,plain,
equal(negate(add(negate(add(d,A)),negate(A))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[48]),112]),
[iquote('back_demod(48),demod([112])')] ).
cnf(118,plain,
equal(negate(negate(add(d,d))),d),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[45]),112]),
[iquote('back_demod(45),demod([112])')] ).
cnf(119,plain,
equal(negate(add(negate(add(A,d)),negate(A))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[23]),112]),
[iquote('back_demod(23),demod([112])')] ).
cnf(120,plain,
equal(add(c,A),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[112,1]),1]),
[iquote('para(112,1),flip(1)')] ).
cnf(139,plain,
equal(negate(add(negate(add(negate(add(d,d)),d)),d)),negate(add(d,d))),
inference(para,[status(thm),theory(equality)],[118,119]),
[iquote('para(118,119)')] ).
cnf(140,plain,
equal(negate(add(negate(A),negate(negate(A)))),c),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[112,12]),120]),
[iquote('para(112,12),demod([120])')] ).
cnf(145,plain,
equal(negate(add(negate(add(d,d)),d)),c),
inference(para,[status(thm),theory(equality)],[118,140]),
[iquote('para(118,140)')] ).
cnf(146,plain,
equal(negate(add(d,d)),c),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[139]),145,120,4]),1]),
[iquote('back_demod(139),demod([145,120,4]),flip(1)')] ).
cnf(150,plain,
equal(negate(negate(add(d,add(d,d)))),add(d,d)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[146,117]),112]),
[iquote('para(146,117),demod([112])')] ).
cnf(159,plain,
equal(negate(add(A,negate(A))),c),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[115,140]),115]),
[iquote('para(115,140),demod([115])')] ).
cnf(173,plain,
equal(negate(add(negate(A),add(negate(add(A,d)),A))),c),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[116,159]),2]),
[iquote('para(116,159),demod([2])')] ).
cnf(176,plain,
equal(negate(negate(add(d,add(A,negate(A))))),add(A,negate(A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[159,117]),112]),
[iquote('para(159,117),demod([112])')] ).
cnf(203,plain,
~ equal(add(negate(add(negate(b),a)),negate(add(negate(b),negate(a)))),b),
inference(para,[status(thm),theory(equality)],[1,27]),
[iquote('para(1,27)')] ).
cnf(210,plain,
equal(negate(add(negate(add(A,d)),add(A,negate(A)))),c),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,173]),2]),
[iquote('para(1,173),demod([2])')] ).
cnf(221,plain,
equal(negate(add(negate(add(A,add(d,d))),negate(A))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[146,3]),112]),
[iquote('para(146,3),demod([112])')] ).
cnf(222,plain,
equal(add(d,d),d),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,221]),112,150]),
[iquote('para(4,221),demod([112,150])')] ).
cnf(302,plain,
equal(negate(add(negate(add(A,add(B,negate(B)))),negate(A))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[159,3]),112]),
[iquote('para(159,3),demod([112])')] ).
cnf(303,plain,
equal(negate(negate(add(A,A))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[159,3]),112]),
[iquote('para(159,3),demod([112])')] ).
cnf(337,plain,
equal(negate(add(negate(add(negate(add(A,A)),d)),A)),negate(add(A,A))),
inference(para,[status(thm),theory(equality)],[303,119]),
[iquote('para(303,119)')] ).
cnf(338,plain,
equal(add(A,negate(A)),d),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,302]),112,176]),
[iquote('para(4,302),demod([112,176])')] ).
cnf(340,plain,
equal(negate(add(negate(add(A,d)),d)),c),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[210]),338]),
[iquote('back_demod(210),demod([338])')] ).
cnf(373,plain,
equal(add(negate(add(A,d)),d),d),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[340,338]),112]),
[iquote('para(340,338),demod([112])')] ).
cnf(375,plain,
equal(add(d,negate(add(A,d))),d),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[373,1]),1]),
[iquote('para(373,1),flip(1)')] ).
cnf(442,plain,
equal(add(A,add(negate(A),B)),add(d,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[338,2]),1]),
[iquote('para(338,2),flip(1)')] ).
cnf(476,plain,
equal(add(A,add(B,negate(A))),add(d,B)),
inference(para,[status(thm),theory(equality)],[1,442]),
[iquote('para(1,442)')] ).
cnf(477,plain,
equal(add(d,A),add(B,add(A,negate(B)))),
inference(flip,[status(thm),theory(equality)],[476]),
[iquote('flip(476)')] ).
cnf(478,plain,
equal(add(A,add(d,negate(A))),d),
inference(para,[status(thm),theory(equality)],[477,222]),
[iquote('para(477,222)')] ).
cnf(479,plain,
equal(add(A,d),d),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[375,478]),2,222]),
[iquote('para(375,478),demod([2,222])')] ).
cnf(481,plain,
equal(negate(add(A,A)),negate(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[337]),479,4,120]),1]),
[iquote('back_demod(337),demod([479,4,120]),flip(1)')] ).
cnf(484,plain,
equal(negate(negate(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[303]),481]),
[iquote('back_demod(303),demod([481])')] ).
cnf(589,plain,
equal(add(negate(add(A,B)),negate(add(A,negate(B)))),negate(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,484]),1]),
[iquote('para(3,484),flip(1)')] ).
cnf(590,plain,
~ equal(b,b),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[203]),589,484]),
[iquote('back_demod(203),demod([589,484])')] ).
cnf(591,plain,
$false,
inference(conflict,[status(thm)],[590]),
[iquote('xx_conflict(590)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : ROB004-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n026.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 : Thu Jun 9 15:35:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.75/1.14 ----- EQP 0.9e, May 2009 -----
% 0.75/1.14 The job began on n026.cluster.edu, Thu Jun 9 15:35:48 2022
% 0.75/1.14 The command was "./eqp09e".
% 0.75/1.14
% 0.75/1.14 set(prolog_style_variables).
% 0.75/1.14 set(lrpo).
% 0.75/1.14 set(basic_paramod).
% 0.75/1.14 set(functional_subsume).
% 0.75/1.14 set(ordered_paramod).
% 0.75/1.14 set(prime_paramod).
% 0.75/1.14 set(para_pairs).
% 0.75/1.14 assign(pick_given_ratio,4).
% 0.75/1.14 clear(print_kept).
% 0.75/1.14 clear(print_new_demod).
% 0.75/1.14 clear(print_back_demod).
% 0.75/1.14 clear(print_given).
% 0.75/1.14 assign(max_mem,64000).
% 0.75/1.14 end_of_commands.
% 0.75/1.14
% 0.75/1.14 Usable:
% 0.75/1.14 end_of_list.
% 0.75/1.14
% 0.75/1.14 Sos:
% 0.75/1.14 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.75/1.14 0 (wt=-1) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.75/1.14 0 (wt=-1) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.75/1.14 0 (wt=-1) [] negate(d) = c.
% 0.75/1.14 0 (wt=-1) [] add(c,d) = d.
% 0.75/1.14 0 (wt=-1) [] add(c,c) = c.
% 0.75/1.14 0 (wt=-1) [] -(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) = b).
% 0.75/1.14 end_of_list.
% 0.75/1.14
% 0.75/1.14 Demodulators:
% 0.75/1.14 end_of_list.
% 0.75/1.14
% 0.75/1.14 Passive:
% 0.75/1.14 end_of_list.
% 0.75/1.14
% 0.75/1.14 Starting to process input.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 0.75/1.14 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 0.75/1.14
% 0.75/1.14 ** KEPT: 2 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.75/1.14 2 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 3 (wt=13) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.75/1.14 3 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 4 (wt=4) [] negate(d) = c.
% 0.75/1.14 4 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 5 (wt=5) [] add(c,d) = d.
% 0.75/1.14 5 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 6 (wt=5) [] add(c,c) = c.
% 0.75/1.14 6 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 7 (wt=14) [] -(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) = b).
% 0.75/1.14 ---------------- PROOF FOUND ----------------
% 0.75/1.14 % SZS status Unsatisfiable
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 After processing input:
% 0.75/1.14
% 0.75/1.14 Usable:
% 0.75/1.14 end_of_list.
% 0.75/1.14
% 0.75/1.14 Sos:
% 0.75/1.14 4 (wt=4) [] negate(d) = c.
% 0.75/1.14 5 (wt=5) [] add(c,d) = d.
% 0.75/1.14 6 (wt=5) [] add(c,c) = c.
% 0.75/1.14 1 (wt=7) [] add(A,B) = add(B,A).
% 0.75/1.14 2 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.75/1.14 3 (wt=13) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.75/1.14 7 (wt=14) [] -(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) = b).
% 0.75/1.14 end_of_list.
% 0.75/1.14
% 0.75/1.14 Demodulators:
% 0.75/1.14 2 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.75/1.14 3 (wt=13) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.75/1.14 4 (wt=4) [] negate(d) = c.
% 0.75/1.14 5 (wt=5) [] add(c,d) = d.
% 0.75/1.14 6 (wt=5) [] add(c,c) = c.
% 0.75/1.14 end_of_list.
% 0.75/1.14
% 0.75/1.14 Passive:
% 0.75/1.14 end_of_list.
% 0.75/1.14
% 0.75/1.14 UNIT CONFLICT from 590 and x=x at 0.04 seconds.
% 0.75/1.14
% 0.75/1.14 ---------------- PROOF ----------------
% 0.75/1.14 % SZS output start Refutation
% See solution above
% 0.75/1.14 ------------ end of proof -------------
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 ------------- memory usage ------------
% 0.75/1.14 Memory dynamically allocated (tp_alloc): 976.
% 0.75/1.14 type (bytes each) gets frees in use avail bytes
% 0.75/1.14 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.75/1.14 term ( 16) 48057 36716 11341 47 220.1 K
% 0.75/1.14 gen_ptr ( 8) 71191 13934 57257 54 447.7 K
% 0.75/1.14 context ( 808) 44554 44552 2 4 4.7 K
% 0.75/1.14 trail ( 12) 18532 18532 0 5 0.1 K
% 0.75/1.14 bt_node ( 68) 17338 17336 2 17 1.3 K
% 0.75/1.14 ac_position (285432) 0 0 0 0 0.0 K
% 0.75/1.14 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.75/1.14 ac_match_free_vars_pos (4020)
% 0.75/1.14 0 0 0 0 0.0 K
% 0.75/1.14 discrim ( 12) 7324 2566 4758 381 60.2 K
% 0.75/1.14 flat ( 40) 95386 95386 0 36 1.4 K
% 0.75/1.14 discrim_pos ( 12) 3254 3254 0 1 0.0 K
% 0.75/1.14 fpa_head ( 12) 1670 0 1670 0 19.6 K
% 0.75/1.14 fpa_tree ( 28) 1599 1599 0 9 0.2 K
% 0.75/1.14 fpa_pos ( 36) 1018 1018 0 1 0.0 K
% 0.75/1.14 literal ( 12) 2981 2391 590 0 6.9 K
% 0.75/1.14 clause ( 24) 2981 2391 590 0 13.8 K
% 0.75/1.14 list ( 12) 488 431 57 4 0.7 K
% 0.75/1.14 list_pos ( 20) 2640 1023 1617 47 32.5 K
% 0.75/1.14 pair_index ( 40) 2 0 2 0 0.1 K
% 0.75/1.14
% 0.75/1.14 -------------- statistics -------------
% 0.75/1.14 Clauses input 7
% 0.75/1.14 Usable input 0
% 0.75/1.14 Sos input 7
% 0.75/1.14 Demodulators input 0
% 0.75/1.14 Passive input 0
% 0.75/1.14
% 0.75/1.14 Processed BS (before search) 8
% 0.75/1.14 Forward subsumed BS 1
% 0.75/1.14 Kept BS 7
% 0.75/1.14 New demodulators BS 5
% 0.75/1.14 Back demodulated BS 0
% 0.75/1.14
% 0.75/1.14 Clauses or pairs given 1848
% 0.75/1.14 Clauses generated 1863
% 0.75/1.14 Forward subsumed 1280
% 0.75/1.14 Deleted by weight 0
% 0.75/1.14 Deleted by variable count 0
% 0.75/1.14 Kept 583
% 0.75/1.14 New demodulators 424
% 0.75/1.14 Back demodulated 204
% 0.75/1.14 Ordered paramod prunes 0
% 0.75/1.14 Basic paramod prunes 4643
% 0.75/1.14 Prime paramod prunes 128
% 0.75/1.14 Semantic prunes 0
% 0.75/1.14
% 0.75/1.14 Rewrite attmepts 20717
% 0.75/1.14 Rewrites 2808
% 0.75/1.14
% 0.75/1.14 FPA overloads 0
% 0.75/1.14 FPA underloads 0
% 0.75/1.14
% 0.75/1.14 Usable size 0
% 0.75/1.14 Sos size 385
% 0.75/1.14 Demodulators size 240
% 0.75/1.14 Passive size 0
% 0.75/1.14 Disabled size 204
% 0.75/1.14
% 0.75/1.14 Proofs found 1
% 0.75/1.14
% 0.75/1.14 ----------- times (seconds) ----------- Thu Jun 9 15:35:48 2022
% 0.75/1.14
% 0.75/1.14 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.75/1.14 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.75/1.14 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.75/1.14 input time 0.00
% 0.75/1.14 paramodulation time 0.01
% 0.75/1.14 demodulation time 0.01
% 0.75/1.14 orient time 0.01
% 0.75/1.14 weigh time 0.00
% 0.75/1.14 forward subsume time 0.00
% 0.75/1.14 back demod find time 0.00
% 0.75/1.14 conflict time 0.00
% 0.75/1.14 LRPO time 0.00
% 0.75/1.14 store clause time 0.01
% 0.75/1.14 disable clause time 0.00
% 0.75/1.14 prime paramod time 0.00
% 0.75/1.14 semantics time 0.00
% 0.75/1.14
% 0.75/1.14 EQP interrupted
%------------------------------------------------------------------------------