TSTP Solution File: ROB023-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : ROB023-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n032.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:40 EDT 2022
% Result : Unsatisfiable 0.57s 0.97s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 5 RR)
% Number of literals : 29 ( 0 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 3 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('ROB023-1.p',unknown),
[] ).
cnf(2,plain,
equal(add(add(A,B),C),add(A,add(B,C))),
file('ROB023-1.p',unknown),
[] ).
cnf(3,plain,
equal(negate(add(negate(add(A,B)),negate(add(A,negate(B))))),A),
file('ROB023-1.p',unknown),
[] ).
cnf(4,plain,
equal(add(A,A),A),
file('ROB023-1.p',unknown),
[] ).
cnf(5,plain,
~ equal(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))),b),
file('ROB023-1.p',unknown),
[] ).
cnf(7,plain,
equal(add(A,add(A,B)),add(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,2]),1]),
[iquote('para(4,2),flip(1)')] ).
cnf(11,plain,
equal(add(A,add(B,A)),add(A,B)),
inference(para,[status(thm),theory(equality)],[1,7]),
[iquote('para(1,7)')] ).
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(A),negate(add(A,negate(A))))),A),
inference(para,[status(thm),theory(equality)],[4,3]),
[iquote('para(4,3)')] ).
cnf(18,plain,
equal(negate(add(negate(A),negate(add(negate(A),A)))),A),
inference(para,[status(thm),theory(equality)],[1,16]),
[iquote('para(1,16)')] ).
cnf(24,plain,
~ equal(add(negate(add(negate(b),a)),negate(add(negate(a),negate(b)))),b),
inference(para,[status(thm),theory(equality)],[1,5]),
[iquote('para(1,5)')] ).
cnf(52,plain,
~ equal(add(negate(add(negate(b),a)),negate(add(negate(b),negate(a)))),b),
inference(para,[status(thm),theory(equality)],[1,24]),
[iquote('para(1,24)')] ).
cnf(58,plain,
equal(negate(add(A,negate(add(negate(A),add(negate(add(A,negate(A))),A))))),add(negate(A),negate(add(A,negate(A))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,16]),16,2]),
[iquote('para(16,16),demod([16,2])')] ).
cnf(70,plain,
equal(negate(add(negate(add(A,add(negate(B),negate(add(A,B))))),A)),negate(add(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,12]),2]),
[iquote('para(3,12),demod([2])')] ).
cnf(73,plain,
equal(negate(add(negate(add(A,B)),negate(add(A,add(B,negate(A)))))),add(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,12]),2]),
[iquote('para(7,12),demod([2])')] ).
cnf(138,plain,
equal(negate(negate(add(A,negate(A)))),add(A,negate(A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,73]),4]),
[iquote('para(4,73),demod([4])')] ).
cnf(172,plain,
equal(negate(add(negate(add(A,negate(A))),A)),negate(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,70]),4,4]),
[iquote('para(4,70),demod([4,4])')] ).
cnf(176,plain,
equal(negate(add(A,negate(add(negate(A),A)))),negate(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,3]),138,11]),
[iquote('para(16,3),demod([138,11])')] ).
cnf(177,plain,
equal(negate(add(negate(add(A,add(negate(B),negate(add(B,negate(B)))))),negate(add(A,B)))),A),
inference(para,[status(thm),theory(equality)],[16,3]),
[iquote('para(16,3)')] ).
cnf(186,plain,
equal(negate(add(negate(A),negate(add(negate(A),add(negate(add(A,negate(A))),A))))),add(negate(add(A,negate(A))),A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[172,18]),172]),
[iquote('para(172,18),demod([172])')] ).
cnf(440,plain,
equal(negate(add(negate(add(A,add(negate(A),negate(add(A,negate(A)))))),negate(A))),A),
inference(para,[status(thm),theory(equality)],[4,177]),
[iquote('para(4,177)')] ).
cnf(441,plain,
equal(negate(add(negate(add(negate(A),add(negate(add(A,negate(A))),A))),negate(A))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,440]),2]),
[iquote('para(1,440),demod([2])')] ).
cnf(442,plain,
equal(negate(add(negate(A),negate(add(A,add(negate(A),negate(add(A,negate(A)))))))),A),
inference(para,[status(thm),theory(equality)],[1,440]),
[iquote('para(1,440)')] ).
cnf(446,plain,
equal(add(negate(add(A,negate(A))),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,441]),186]),
[iquote('para(1,441),demod([186])')] ).
cnf(451,plain,
equal(add(negate(A),negate(add(A,negate(A)))),negate(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[58]),446,176]),1]),
[iquote('back_demod(58),demod([446,176]),flip(1)')] ).
cnf(452,plain,
equal(negate(negate(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[442]),451,451]),
[iquote('back_demod(442),demod([451,451])')] ).
cnf(506,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,452]),1]),
[iquote('para(3,452),flip(1)')] ).
cnf(511,plain,
~ equal(b,b),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[52]),506,452]),
[iquote('back_demod(52),demod([506,452])')] ).
cnf(512,plain,
$false,
inference(conflict,[status(thm)],[511]),
[iquote('xx_conflict(511)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : ROB023-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.11 % Command : tptp2X_and_run_eqp %s
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Thu Jun 9 15:05:07 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.57/0.97 ----- EQP 0.9e, May 2009 -----
% 0.57/0.97 The job began on n032.cluster.edu, Thu Jun 9 15:05:08 2022
% 0.57/0.97 The command was "./eqp09e".
% 0.57/0.97
% 0.57/0.97 set(prolog_style_variables).
% 0.57/0.97 set(lrpo).
% 0.57/0.97 set(basic_paramod).
% 0.57/0.97 set(functional_subsume).
% 0.57/0.97 set(ordered_paramod).
% 0.57/0.97 set(prime_paramod).
% 0.57/0.97 set(para_pairs).
% 0.57/0.97 assign(pick_given_ratio,4).
% 0.57/0.97 clear(print_kept).
% 0.57/0.97 clear(print_new_demod).
% 0.57/0.97 clear(print_back_demod).
% 0.57/0.97 clear(print_given).
% 0.57/0.97 assign(max_mem,64000).
% 0.57/0.97 end_of_commands.
% 0.57/0.97
% 0.57/0.97 Usable:
% 0.57/0.97 end_of_list.
% 0.57/0.97
% 0.57/0.97 Sos:
% 0.57/0.97 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.57/0.97 0 (wt=-1) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.57/0.97 0 (wt=-1) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.57/0.97 0 (wt=-1) [] add(A,A) = A.
% 0.57/0.97 0 (wt=-1) [] -(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) = b).
% 0.57/0.97 end_of_list.
% 0.57/0.97
% 0.57/0.97 Demodulators:
% 0.57/0.97 end_of_list.
% 0.57/0.97
% 0.57/0.97 Passive:
% 0.57/0.97 end_of_list.
% 0.57/0.97
% 0.57/0.97 Starting to process input.
% 0.57/0.97
% 0.57/0.97 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 0.57/0.97 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 0.57/0.97
% 0.57/0.97 ** KEPT: 2 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.57/0.97 2 is a new demodulator.
% 0.57/0.97
% 0.57/0.97 ** KEPT: 3 (wt=13) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.57/0.97 3 is a new demodulator.
% 0.57/0.97
% 0.57/0.97 ** KEPT: 4 (wt=5) [] add(A,A) = A.
% 0.57/0.97 4 is a new demodulator.
% 0.57/0.97
% 0.57/0.97 ** KEPT: 5 (wt=14) [] -(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) = b).
% 0.57/0.97 ---------------- PROOF FOUND ----------------
% 0.57/0.97 % SZS status Unsatisfiable
% 0.57/0.97
% 0.57/0.97
% 0.57/0.97 After processing input:
% 0.57/0.97
% 0.57/0.97 Usable:
% 0.57/0.97 end_of_list.
% 0.57/0.97
% 0.57/0.97 Sos:
% 0.57/0.97 4 (wt=5) [] add(A,A) = A.
% 0.57/0.97 1 (wt=7) [] add(A,B) = add(B,A).
% 0.57/0.97 2 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.57/0.97 3 (wt=13) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.57/0.97 5 (wt=14) [] -(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) = b).
% 0.57/0.97 end_of_list.
% 0.57/0.97
% 0.57/0.97 Demodulators:
% 0.57/0.97 2 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.57/0.97 3 (wt=13) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.57/0.97 4 (wt=5) [] add(A,A) = A.
% 0.57/0.97 end_of_list.
% 0.57/0.97
% 0.57/0.97 Passive:
% 0.57/0.97 end_of_list.
% 0.57/0.97
% 0.57/0.97 UNIT CONFLICT from 511 and x=x at 0.03 seconds.
% 0.57/0.97
% 0.57/0.97 ---------------- PROOF ----------------
% 0.57/0.97 % SZS output start Refutation
% See solution above
% 0.57/0.97 ------------ end of proof -------------
% 0.57/0.97
% 0.57/0.97
% 0.57/0.97 ------------- memory usage ------------
% 0.57/0.97 Memory dynamically allocated (tp_alloc): 976.
% 0.57/0.97 type (bytes each) gets frees in use avail bytes
% 0.57/0.97 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.57/0.97 term ( 16) 53895 43142 10753 27 208.5 K
% 0.57/0.97 gen_ptr ( 8) 73247 15800 57447 28 449.0 K
% 0.57/0.97 context ( 808) 38279 38277 2 5 5.5 K
% 0.57/0.97 trail ( 12) 4668 4668 0 5 0.1 K
% 0.57/0.97 bt_node ( 68) 12713 12711 2 17 1.3 K
% 0.57/0.97 ac_position (285432) 0 0 0 0 0.0 K
% 0.57/0.97 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.57/0.97 ac_match_free_vars_pos (4020)
% 0.57/0.97 0 0 0 0 0.0 K
% 0.57/0.97 discrim ( 12) 8439 4221 4218 3108 85.9 K
% 0.57/0.97 flat ( 40) 120052 120052 0 36 1.4 K
% 0.57/0.97 discrim_pos ( 12) 2767 2767 0 1 0.0 K
% 0.57/0.97 fpa_head ( 12) 1643 0 1643 0 19.3 K
% 0.57/0.97 fpa_tree ( 28) 2019 2019 0 9 0.2 K
% 0.57/0.97 fpa_pos ( 36) 990 990 0 1 0.0 K
% 0.57/0.97 literal ( 12) 2690 2179 511 0 6.0 K
% 0.57/0.97 clause ( 24) 2690 2179 511 0 12.0 K
% 0.57/0.97 list ( 12) 539 482 57 5 0.7 K
% 0.57/0.97 list_pos ( 20) 2437 1050 1387 423 35.4 K
% 0.57/0.97 pair_index ( 40) 2 0 2 0 0.1 K
% 0.57/0.97
% 0.57/0.97 -------------- statistics -------------
% 0.57/0.97 Clauses input 5
% 0.57/0.97 Usable input 0
% 0.57/0.97 Sos input 5
% 0.57/0.97 Demodulators input 0
% 0.57/0.97 Passive input 0
% 0.57/0.97
% 0.57/0.97 Processed BS (before search) 6
% 0.57/0.97 Forward subsumed BS 1
% 0.57/0.97 Kept BS 5
% 0.57/0.97 New demodulators BS 3
% 0.57/0.97 Back demodulated BS 0
% 0.57/0.97
% 0.57/0.97 Clauses or pairs given 996
% 0.57/0.97 Clauses generated 1517
% 0.57/0.97 Forward subsumed 1011
% 0.57/0.97 Deleted by weight 0
% 0.57/0.97 Deleted by variable count 0
% 0.57/0.97 Kept 506
% 0.57/0.97 New demodulators 477
% 0.57/0.97 Back demodulated 210
% 0.57/0.97 Ordered paramod prunes 0
% 0.57/0.97 Basic paramod prunes 2836
% 0.57/0.97 Prime paramod prunes 15
% 0.57/0.97 Semantic prunes 0
% 0.57/0.97
% 0.57/0.97 Rewrite attmepts 21022
% 0.57/0.97 Rewrites 2411
% 0.57/0.97
% 0.57/0.97 FPA overloads 0
% 0.57/0.97 FPA underloads 0
% 0.57/0.97
% 0.57/0.97 Usable size 0
% 0.57/0.97 Sos size 300
% 0.57/0.97 Demodulators size 275
% 0.57/0.97 Passive size 0
% 0.57/0.97 Disabled size 210
% 0.57/0.97
% 0.57/0.97 Proofs found 1
% 0.57/0.97
% 0.57/0.97 ----------- times (seconds) ----------- Thu Jun 9 15:05:08 2022
% 0.57/0.97
% 0.57/0.97 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.57/0.97 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.57/0.97 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.57/0.97 input time 0.00
% 0.57/0.97 paramodulation time 0.01
% 0.57/0.97 demodulation time 0.00
% 0.57/0.97 orient time 0.00
% 0.57/0.97 weigh time 0.00
% 0.57/0.97 forward subsume time 0.00
% 0.57/0.97 back demod find time 0.00
% 0.57/0.97 conflict time 0.00
% 0.57/0.97 LRPO time 0.00
% 0.57/0.97 store clause time 0.01
% 0.57/0.97 disable clause time 0.00
% 0.57/0.97 prime paramod time 0.00
% 0.57/0.97 semantics time 0.00
% 0.57/0.97
% 0.57/0.97 EQP interrupted
%------------------------------------------------------------------------------