TSTP Solution File: ROB003-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : ROB003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n024.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.41s 1.05s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 5 RR)
% Number of literals : 20 ( 0 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('ROB003-1.p',unknown),
[] ).
cnf(2,plain,
equal(add(add(A,B),C),add(A,add(B,C))),
file('ROB003-1.p',unknown),
[] ).
cnf(3,plain,
equal(negate(add(negate(add(A,B)),negate(add(A,negate(B))))),A),
file('ROB003-1.p',unknown),
[] ).
cnf(4,plain,
equal(add(A,c),c),
file('ROB003-1.p',unknown),
[] ).
cnf(5,plain,
~ equal(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))),b),
file('ROB003-1.p',unknown),
[] ).
cnf(6,plain,
equal(add(c,A),c),
inference(para,[status(thm),theory(equality)],[1,4]),
[iquote('para(1,4)')] ).
cnf(10,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(14,plain,
equal(negate(add(negate(c),negate(add(A,negate(c))))),A),
inference(para,[status(thm),theory(equality)],[4,3]),
[iquote('para(4,3)')] ).
cnf(15,plain,
equal(negate(add(negate(c),negate(c))),c),
inference(para,[status(thm),theory(equality)],[6,14]),
[iquote('para(6,14)')] ).
cnf(20,plain,
~ equal(add(negate(add(a,negate(b))),negate(add(negate(b),negate(a)))),b),
inference(para,[status(thm),theory(equality)],[1,5]),
[iquote('para(1,5)')] ).
cnf(21,plain,
equal(negate(add(negate(c),negate(add(negate(c),A)))),A),
inference(para,[status(thm),theory(equality)],[1,14]),
[iquote('para(1,14)')] ).
cnf(22,plain,
equal(negate(add(negate(add(A,negate(c))),negate(c))),A),
inference(para,[status(thm),theory(equality)],[1,14]),
[iquote('para(1,14)')] ).
cnf(23,plain,
equal(negate(add(negate(add(negate(c),A)),negate(c))),A),
inference(para,[status(thm),theory(equality)],[1,21]),
[iquote('para(1,21)')] ).
cnf(36,plain,
equal(add(negate(c),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,10]),2,4,23]),
[iquote('para(15,10),demod([2,4,23])')] ).
cnf(37,plain,
equal(negate(add(negate(A),negate(c))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[23]),36]),
[iquote('back_demod(23),demod([36])')] ).
cnf(38,plain,
equal(add(A,negate(c)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[22]),37]),
[iquote('back_demod(22),demod([37])')] ).
cnf(39,plain,
equal(negate(negate(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[37]),38]),
[iquote('back_demod(37),demod([38])')] ).
cnf(55,plain,
equal(add(negate(add(A,B)),negate(add(B,negate(A)))),negate(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,39]),1]),
[iquote('para(10,39),flip(1)')] ).
cnf(56,plain,
~ equal(b,b),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[20]),55,39]),
[iquote('back_demod(20),demod([55,39])')] ).
cnf(57,plain,
$false,
inference(conflict,[status(thm)],[56]),
[iquote('xx_conflict(56)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : ROB003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n024.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 13:17:04 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.05 ----- EQP 0.9e, May 2009 -----
% 0.41/1.05 The job began on n024.cluster.edu, Thu Jun 9 13:17:05 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(A,B) = add(B,A).
% 0.41/1.05 0 (wt=-1) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.41/1.05 0 (wt=-1) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.41/1.05 0 (wt=-1) [] add(A,c) = c.
% 0.41/1.05 0 (wt=-1) [] -(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) = b).
% 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=7) [] add(A,B) = add(B,A).
% 0.41/1.05 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 0.41/1.05
% 0.41/1.05 ** KEPT: 2 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.41/1.05 2 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 3 (wt=13) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.41/1.05 3 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 4 (wt=5) [] add(A,c) = c.
% 0.41/1.05 4 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 5 (wt=14) [] -(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) = b).
% 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 4 (wt=5) [] add(A,c) = c.
% 0.41/1.05 1 (wt=7) [] add(A,B) = add(B,A).
% 0.41/1.05 2 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.41/1.05 3 (wt=13) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.41/1.05 5 (wt=14) [] -(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) = b).
% 0.41/1.05 end_of_list.
% 0.41/1.05
% 0.41/1.05 Demodulators:
% 0.41/1.05 2 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.41/1.05 3 (wt=13) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.41/1.05 4 (wt=5) [] add(A,c) = c.
% 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 56 and x=x 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) 4294 3536 758 20 15.0 K
% 0.41/1.05 gen_ptr ( 8) 4395 1145 3250 19 25.5 K
% 0.41/1.05 context ( 808) 3601 3599 2 3 3.9 K
% 0.41/1.05 trail ( 12) 153 153 0 3 0.0 K
% 0.41/1.05 bt_node ( 68) 1332 1330 2 9 0.7 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) 558 138 420 43 5.4 K
% 0.41/1.05 flat ( 40) 6389 6389 0 20 0.8 K
% 0.41/1.05 discrim_pos ( 12) 224 224 0 1 0.0 K
% 0.41/1.05 fpa_head ( 12) 353 0 353 0 4.1 K
% 0.41/1.05 fpa_tree ( 28) 131 131 0 5 0.1 K
% 0.41/1.05 fpa_pos ( 36) 93 93 0 1 0.0 K
% 0.41/1.05 literal ( 12) 287 231 56 0 0.7 K
% 0.41/1.05 clause ( 24) 287 231 56 0 1.3 K
% 0.41/1.05 list ( 12) 97 40 57 4 0.7 K
% 0.41/1.05 list_pos ( 20) 236 67 169 8 3.5 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 5
% 0.41/1.05 Usable input 0
% 0.41/1.05 Sos input 5
% 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) 6
% 0.41/1.05 Forward subsumed BS 1
% 0.41/1.05 Kept BS 5
% 0.41/1.05 New demodulators BS 3
% 0.41/1.05 Back demodulated BS 0
% 0.41/1.05
% 0.41/1.05 Clauses or pairs given 146
% 0.41/1.05 Clauses generated 184
% 0.41/1.05 Forward subsumed 133
% 0.41/1.05 Deleted by weight 0
% 0.41/1.05 Deleted by variable count 0
% 0.41/1.05 Kept 51
% 0.41/1.05 New demodulators 35
% 0.41/1.05 Back demodulated 12
% 0.41/1.05 Ordered paramod prunes 0
% 0.41/1.05 Basic paramod prunes 206
% 0.41/1.05 Prime paramod prunes 0
% 0.41/1.05 Semantic prunes 0
% 0.41/1.05
% 0.41/1.05 Rewrite attmepts 1592
% 0.41/1.05 Rewrites 193
% 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 43
% 0.41/1.05 Demodulators size 27
% 0.41/1.05 Passive size 0
% 0.41/1.05 Disabled size 12
% 0.41/1.05
% 0.41/1.05 Proofs found 1
% 0.41/1.05
% 0.41/1.05 ----------- times (seconds) ----------- Thu Jun 9 13:17:05 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.01 (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
%------------------------------------------------------------------------------