TSTP Solution File: ROB009-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : ROB009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n023.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:37 EDT 2022
% Result : Unsatisfiable 0.67s 1.07s
% Output : Refutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 5 RR)
% Number of literals : 10 ( 0 equ; 1 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('ROB009-1.p',unknown),
[] ).
cnf(2,plain,
equal(add(add(A,B),C),add(A,add(B,C))),
file('ROB009-1.p',unknown),
[] ).
cnf(3,plain,
equal(negate(add(negate(add(A,B)),negate(add(A,negate(B))))),A),
file('ROB009-1.p',unknown),
[] ).
cnf(4,plain,
equal(negate(add(a,negate(add(b,c)))),negate(add(b,negate(add(a,c))))),
file('ROB009-1.p',unknown),
[] ).
cnf(5,plain,
~ equal(b,a),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,plain,
equal(add(A,add(B,C)),add(B,add(A,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,2]),2]),
[iquote('para(1,2),demod([2])')] ).
cnf(28,plain,
equal(negate(add(negate(add(a,add(b,c))),negate(add(b,negate(add(a,c)))))),a),
inference(para,[status(thm),theory(equality)],[4,3]),
[iquote('para(4,3)')] ).
cnf(41,plain,
equal(negate(add(negate(add(A,add(B,C))),negate(add(B,negate(add(A,C)))))),B),
inference(para,[status(thm),theory(equality)],[8,3]),
[iquote('para(8,3)')] ).
cnf(42,plain,
equal(b,a),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[28]),41]),
[iquote('back_demod(28),demod([41])')] ).
cnf(43,plain,
$false,
inference(conflict,[status(thm)],[42,5]),
[iquote('conflict(42,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ROB009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 9 14:54:22 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.67/1.07 ----- EQP 0.9e, May 2009 -----
% 0.67/1.07 The job began on n023.cluster.edu, Thu Jun 9 14:54:23 2022
% 0.67/1.07 The command was "./eqp09e".
% 0.67/1.07
% 0.67/1.07 set(prolog_style_variables).
% 0.67/1.07 set(lrpo).
% 0.67/1.07 set(basic_paramod).
% 0.67/1.07 set(functional_subsume).
% 0.67/1.07 set(ordered_paramod).
% 0.67/1.07 set(prime_paramod).
% 0.67/1.07 set(para_pairs).
% 0.67/1.07 assign(pick_given_ratio,4).
% 0.67/1.07 clear(print_kept).
% 0.67/1.07 clear(print_new_demod).
% 0.67/1.07 clear(print_back_demod).
% 0.67/1.07 clear(print_given).
% 0.67/1.07 assign(max_mem,64000).
% 0.67/1.07 end_of_commands.
% 0.67/1.07
% 0.67/1.07 Usable:
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Sos:
% 0.67/1.07 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.67/1.07 0 (wt=-1) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.67/1.07 0 (wt=-1) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.67/1.07 0 (wt=-1) [] negate(add(a,negate(add(b,c)))) = negate(add(b,negate(add(a,c)))).
% 0.67/1.07 0 (wt=-1) [] -(a = b).
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Demodulators:
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Passive:
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Starting to process input.
% 0.67/1.07
% 0.67/1.07 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 0.67/1.07 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 0.67/1.07
% 0.67/1.07 ** KEPT: 2 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.67/1.07 2 is a new demodulator.
% 0.67/1.07
% 0.67/1.07 ** KEPT: 3 (wt=13) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.67/1.07 3 is a new demodulator.
% 0.67/1.07
% 0.67/1.07 ** KEPT: 4 (wt=15) [] negate(add(a,negate(add(b,c)))) = negate(add(b,negate(add(a,c)))).
% 0.67/1.07 4 is a new demodulator.
% 0.67/1.07
% 0.67/1.07 ** KEPT: 5 (wt=3) [flip(1)] -(b = a).
% 0.67/1.07 ---------------- PROOF FOUND ----------------
% 0.67/1.07 % SZS status Unsatisfiable
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 After processing input:
% 0.67/1.07
% 0.67/1.07 Usable:
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Sos:
% 0.67/1.07 5 (wt=3) [flip(1)] -(b = a).
% 0.67/1.07 1 (wt=7) [] add(A,B) = add(B,A).
% 0.67/1.07 2 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.67/1.07 3 (wt=13) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.67/1.07 4 (wt=15) [] negate(add(a,negate(add(b,c)))) = negate(add(b,negate(add(a,c)))).
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Demodulators:
% 0.67/1.07 2 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.67/1.07 3 (wt=13) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.67/1.07 4 (wt=15) [] negate(add(a,negate(add(b,c)))) = negate(add(b,negate(add(a,c)))).
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Passive:
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 UNIT CONFLICT from 42 and 5 at 0.00 seconds.
% 0.67/1.07
% 0.67/1.07 ---------------- PROOF ----------------
% 0.67/1.07 % SZS output start Refutation
% See solution above
% 0.67/1.07 ------------ end of proof -------------
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 ------------- memory usage ------------
% 0.67/1.07 Memory dynamically allocated (tp_alloc): 488.
% 0.67/1.07 type (bytes each) gets frees in use avail bytes
% 0.67/1.07 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.67/1.07 term ( 16) 2615 2011 604 17 12.0 K
% 0.67/1.07 gen_ptr ( 8) 2865 333 2532 15 19.9 K
% 0.67/1.07 context ( 808) 1535 1533 2 3 3.9 K
% 0.67/1.07 trail ( 12) 74 74 0 3 0.0 K
% 0.67/1.07 bt_node ( 68) 407 404 3 8 0.7 K
% 0.67/1.07 ac_position (285432) 0 0 0 0 0.0 K
% 0.67/1.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.67/1.07 ac_match_free_vars_pos (4020)
% 0.67/1.07 0 0 0 0 0.0 K
% 0.67/1.07 discrim ( 12) 422 23 399 23 4.9 K
% 0.67/1.07 flat ( 40) 3927 3927 0 19 0.7 K
% 0.67/1.07 discrim_pos ( 12) 78 78 0 1 0.0 K
% 0.67/1.07 fpa_head ( 12) 344 0 344 0 4.0 K
% 0.67/1.07 fpa_tree ( 28) 99 99 0 11 0.3 K
% 0.67/1.07 fpa_pos ( 36) 64 64 0 1 0.0 K
% 0.67/1.07 literal ( 12) 176 134 42 1 0.5 K
% 0.67/1.07 clause ( 24) 176 134 42 1 1.0 K
% 0.67/1.07 list ( 12) 81 24 57 2 0.7 K
% 0.67/1.07 list_pos ( 20) 152 10 142 4 2.9 K
% 0.67/1.07 pair_index ( 40) 2 0 2 0 0.1 K
% 0.67/1.07
% 0.67/1.07 -------------- statistics -------------
% 0.67/1.07 Clauses input 5
% 0.67/1.07 Usable input 0
% 0.67/1.07 Sos input 5
% 0.67/1.07 Demodulators input 0
% 0.67/1.07 Passive input 0
% 0.67/1.07
% 0.67/1.07 Processed BS (before search) 6
% 0.67/1.07 Forward subsumed BS 1
% 0.67/1.07 Kept BS 5
% 0.67/1.07 New demodulators BS 3
% 0.67/1.07 Back demodulated BS 0
% 0.67/1.07
% 0.67/1.07 Clauses or pairs given 70
% 0.67/1.07 Clauses generated 90
% 0.67/1.07 Forward subsumed 53
% 0.67/1.07 Deleted by weight 0
% 0.67/1.07 Deleted by variable count 0
% 0.67/1.07 Kept 37
% 0.67/1.07 New demodulators 19
% 0.67/1.07 Back demodulated 1
% 0.67/1.07 Ordered paramod prunes 0
% 0.67/1.07 Basic paramod prunes 30
% 0.67/1.07 Prime paramod prunes 0
% 0.67/1.07 Semantic prunes 0
% 0.67/1.07
% 0.67/1.07 Rewrite attmepts 822
% 0.67/1.07 Rewrites 47
% 0.67/1.07
% 0.67/1.07 FPA overloads 0
% 0.67/1.07 FPA underloads 0
% 0.67/1.07
% 0.67/1.07 Usable size 0
% 0.67/1.07 Sos size 40
% 0.67/1.07 Demodulators size 21
% 0.67/1.07 Passive size 0
% 0.67/1.07 Disabled size 1
% 0.67/1.07
% 0.67/1.07 Proofs found 1
% 0.67/1.07
% 0.67/1.07 ----------- times (seconds) ----------- Thu Jun 9 14:54:23 2022
% 0.67/1.07
% 0.67/1.07 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.67/1.07 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.67/1.07 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.67/1.07 input time 0.00
% 0.67/1.07 paramodulation time 0.00
% 0.67/1.07 demodulation time 0.00
% 0.67/1.07 orient time 0.00
% 0.67/1.07 weigh time 0.00
% 0.67/1.07 forward subsume time 0.00
% 0.67/1.07 back demod find time 0.00
% 0.67/1.07 conflict time 0.00
% 0.67/1.07 LRPO time 0.00
% 0.67/1.07 store clause time 0.00
% 0.67/1.07 disable clause time 0.00
% 0.67/1.07 prime paramod time 0.00
% 0.67/1.07 semantics time 0.00
% 0.67/1.07
% 0.67/1.07 EQP interrupted
%------------------------------------------------------------------------------