TSTP Solution File: ALG007-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : ALG007-1 : TPTP v8.1.0. Released v2.2.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 : Thu Jul 14 15:38:13 EDT 2022
% Result : Unsatisfiable 0.99s 1.35s
% Output : Refutation 0.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of clauses : 28 ( 28 unt; 0 nHn; 3 RR)
% Number of literals : 28 ( 0 equ; 2 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 75 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(difference(A,difference(B,A)),A),
file('ALG007-1.p',unknown),
[] ).
cnf(2,plain,
equal(difference(A,difference(A,B)),difference(B,difference(B,A))),
file('ALG007-1.p',unknown),
[] ).
cnf(3,plain,
equal(difference(difference(A,B),C),difference(difference(A,C),B)),
file('ALG007-1.p',unknown),
[] ).
cnf(4,plain,
~ equal(difference(difference(a,c),difference(b,c)),difference(difference(a,b),c)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(9,plain,
equal(difference(A,difference(difference(B,A),C)),A),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(10,plain,
equal(difference(difference(A,difference(B,difference(A,C))),C),difference(A,C)),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(11,plain,
equal(difference(difference(A,B),difference(C,A)),difference(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,3]),1]),
[iquote('para(1,3),flip(1)')] ).
cnf(13,plain,
equal(difference(difference(difference(A,B),C),B),difference(difference(A,B),C)),
inference(para,[status(thm),theory(equality)],[9,1]),
[iquote('para(9,1)')] ).
cnf(14,plain,
equal(difference(difference(A,B),difference(B,C)),difference(A,B)),
inference(para,[status(thm),theory(equality)],[1,9]),
[iquote('para(1,9)')] ).
cnf(16,plain,
equal(difference(difference(A,B),difference(difference(A,C),B)),difference(C,difference(C,difference(A,B)))),
inference(para,[status(thm),theory(equality)],[3,2]),
[iquote('para(3,2)')] ).
cnf(17,plain,
equal(difference(difference(A,difference(difference(A,B),C)),B),difference(C,difference(C,difference(A,B)))),
inference(para,[status(thm),theory(equality)],[3,2]),
[iquote('para(3,2)')] ).
cnf(18,plain,
equal(difference(difference(A,difference(A,B)),C),difference(difference(B,C),difference(B,A))),
inference(para,[status(thm),theory(equality)],[2,3]),
[iquote('para(2,3)')] ).
cnf(19,plain,
equal(difference(difference(A,B),difference(A,C)),difference(difference(C,difference(C,A)),B)),
inference(flip,[status(thm),theory(equality)],[18]),
[iquote('flip(18)')] ).
cnf(24,plain,
equal(difference(A,difference(B,difference(B,difference(C,A)))),A),
inference(para,[status(thm),theory(equality)],[2,9]),
[iquote('para(2,9)')] ).
cnf(42,plain,
equal(difference(difference(difference(A,difference(B,difference(A,C))),D),C),difference(difference(A,C),D)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,3]),1]),
[iquote('para(10,3),flip(1)')] ).
cnf(47,plain,
equal(difference(A,difference(A,difference(A,B))),difference(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,2]),1]),
[iquote('para(11,2),flip(1)')] ).
cnf(50,plain,
equal(difference(difference(difference(A,B),C),difference(D,difference(A,C))),difference(difference(A,C),B)),
inference(para,[status(thm),theory(equality)],[3,11]),
[iquote('para(3,11)')] ).
cnf(70,plain,
equal(difference(difference(A,difference(B,C)),B),difference(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,3]),1]),
[iquote('para(14,3),flip(1)')] ).
cnf(152,plain,
equal(difference(difference(A,difference(difference(B,C),D)),B),difference(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[70,70]),70]),1]),
[iquote('para(70,70),demod([70]),flip(1)')] ).
cnf(326,plain,
equal(difference(A,difference(difference(B,C),difference(difference(A,difference(A,B)),C))),A),
inference(para,[status(thm),theory(equality)],[19,24]),
[iquote('para(19,24)')] ).
cnf(334,plain,
equal(difference(difference(A,B),difference(difference(C,difference(C,A)),B)),difference(difference(A,B),C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[326,1]),152]),1]),
[iquote('para(326,1),demod([152]),flip(1)')] ).
cnf(626,plain,
equal(difference(difference(A,B),difference(difference(A,B),difference(A,C))),difference(difference(A,B),C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,42]),13]),
[iquote('para(17,42),demod([13])')] ).
cnf(760,plain,
equal(difference(difference(A,difference(A,B)),C),difference(B,difference(B,difference(A,C)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[47,16]),16,626]),1]),
[iquote('para(47,16),demod([16,626]),flip(1)')] ).
cnf(841,plain,
equal(difference(difference(A,B),difference(A,difference(A,difference(C,B)))),difference(difference(A,B),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[334]),760]),
[iquote('back_demod(334),demod([760])')] ).
cnf(994,plain,
equal(difference(difference(A,B),difference(A,difference(A,C))),difference(difference(A,B),C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[47,50]),50]),1]),
[iquote('para(47,50),demod([50]),flip(1)')] ).
cnf(1002,plain,
equal(difference(difference(A,B),difference(C,B)),difference(difference(A,B),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[841]),994]),
[iquote('back_demod(841),demod([994])')] ).
cnf(1023,plain,
~ equal(difference(difference(a,c),b),difference(difference(a,b),c)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4]),1002]),
[iquote('back_demod(4),demod([1002])')] ).
cnf(1024,plain,
$false,
inference(conflict,[status(thm)],[1023,3]),
[iquote('conflict(1023,3)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ALG007-1 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Wed Jun 8 13:13:23 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.99/1.35 ----- EQP 0.9e, May 2009 -----
% 0.99/1.35 The job began on n023.cluster.edu, Wed Jun 8 13:13:24 2022
% 0.99/1.35 The command was "./eqp09e".
% 0.99/1.35
% 0.99/1.35 set(prolog_style_variables).
% 0.99/1.35 set(lrpo).
% 0.99/1.35 set(basic_paramod).
% 0.99/1.35 set(functional_subsume).
% 0.99/1.35 set(ordered_paramod).
% 0.99/1.35 set(prime_paramod).
% 0.99/1.35 set(para_pairs).
% 0.99/1.35 assign(pick_given_ratio,4).
% 0.99/1.35 clear(print_kept).
% 0.99/1.35 clear(print_new_demod).
% 0.99/1.35 clear(print_back_demod).
% 0.99/1.35 clear(print_given).
% 0.99/1.35 assign(max_mem,64000).
% 0.99/1.35 end_of_commands.
% 0.99/1.35
% 0.99/1.35 Usable:
% 0.99/1.35 end_of_list.
% 0.99/1.35
% 0.99/1.35 Sos:
% 0.99/1.35 0 (wt=-1) [] difference(A,difference(B,A)) = A.
% 0.99/1.35 0 (wt=-1) [] difference(A,difference(A,B)) = difference(B,difference(B,A)).
% 0.99/1.35 0 (wt=-1) [] difference(difference(A,B),C) = difference(difference(A,C),B).
% 0.99/1.35 0 (wt=-1) [] -(difference(difference(a,b),c) = difference(difference(a,c),difference(b,c))).
% 0.99/1.35 end_of_list.
% 0.99/1.35
% 0.99/1.35 Demodulators:
% 0.99/1.35 end_of_list.
% 0.99/1.35
% 0.99/1.35 Passive:
% 0.99/1.35 end_of_list.
% 0.99/1.35
% 0.99/1.35 Starting to process input.
% 0.99/1.35
% 0.99/1.35 ** KEPT: 1 (wt=7) [] difference(A,difference(B,A)) = A.
% 0.99/1.35 1 is a new demodulator.
% 0.99/1.35
% 0.99/1.35 ** KEPT: 2 (wt=11) [] difference(A,difference(A,B)) = difference(B,difference(B,A)).
% 0.99/1.35 clause forward subsumed: 0 (wt=11) [flip(2)] difference(B,difference(B,A)) = difference(A,difference(A,B)).
% 0.99/1.35
% 0.99/1.35 ** KEPT: 3 (wt=11) [] difference(difference(A,B),C) = difference(difference(A,C),B).
% 0.99/1.35 clause forward subsumed: 0 (wt=11) [flip(3)] difference(difference(A,C),B) = difference(difference(A,B),C).
% 0.99/1.35
% 0.99/1.35 ** KEPT: 4 (wt=13) [flip(1)] -(difference(difference(a,c),difference(b,c)) = difference(difference(a,b),c)).
% 0.99/1.35 ---------------- PROOF FOUND ----------------
% 0.99/1.35 % SZS status Unsatisfiable
% 0.99/1.35
% 0.99/1.35
% 0.99/1.35 After processing input:
% 0.99/1.35
% 0.99/1.35 Usable:
% 0.99/1.35 end_of_list.
% 0.99/1.35
% 0.99/1.35 Sos:
% 0.99/1.35 1 (wt=7) [] difference(A,difference(B,A)) = A.
% 0.99/1.35 2 (wt=11) [] difference(A,difference(A,B)) = difference(B,difference(B,A)).
% 0.99/1.35 3 (wt=11) [] difference(difference(A,B),C) = difference(difference(A,C),B).
% 0.99/1.35 4 (wt=13) [flip(1)] -(difference(difference(a,c),difference(b,c)) = difference(difference(a,b),c)).
% 0.99/1.35 end_of_list.
% 0.99/1.35
% 0.99/1.35 Demodulators:
% 0.99/1.35 1 (wt=7) [] difference(A,difference(B,A)) = A.
% 0.99/1.35 end_of_list.
% 0.99/1.35
% 0.99/1.35 Passive:
% 0.99/1.35 end_of_list.
% 0.99/1.35
% 0.99/1.35 UNIT CONFLICT from 1023 and 3 at 0.12 seconds.
% 0.99/1.35
% 0.99/1.35 ---------------- PROOF ----------------
% 0.99/1.35 % SZS output start Refutation
% See solution above
% 0.99/1.35 ------------ end of proof -------------
% 0.99/1.35
% 0.99/1.35
% 0.99/1.35 ------------- memory usage ------------
% 0.99/1.35 Memory dynamically allocated (tp_alloc): 1464.
% 0.99/1.35 type (bytes each) gets frees in use avail bytes
% 0.99/1.35 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.99/1.35 term ( 16) 238939 217158 21781 18 421.8 K
% 0.99/1.35 gen_ptr ( 8) 139486 50766 88720 28 693.3 K
% 0.99/1.35 context ( 808) 116474 116472 2 6 6.3 K
% 0.99/1.35 trail ( 12) 21706 21706 0 7 0.1 K
% 0.99/1.35 bt_node ( 68) 42960 42957 3 10 0.9 K
% 0.99/1.35 ac_position (285432) 0 0 0 0 0.0 K
% 0.99/1.35 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.99/1.35 ac_match_free_vars_pos (4020)
% 0.99/1.35 0 0 0 0 0.0 K
% 0.99/1.35 discrim ( 12) 12880 4663 8217 747 105.0 K
% 0.99/1.35 flat ( 40) 477033 477033 0 49 1.9 K
% 0.99/1.35 discrim_pos ( 12) 12246 12246 0 1 0.0 K
% 0.99/1.35 fpa_head ( 12) 894 0 894 0 10.5 K
% 0.99/1.35 fpa_tree ( 28) 1968 1968 0 21 0.6 K
% 0.99/1.35 fpa_pos ( 36) 1568 1568 0 1 0.0 K
% 0.99/1.35 literal ( 12) 11888 10865 1023 1 12.0 K
% 0.99/1.35 clause ( 24) 11888 10865 1023 1 24.0 K
% 0.99/1.35 list ( 12) 604 546 58 1 0.7 K
% 0.99/1.35 list_pos ( 20) 4436 1825 2611 197 54.8 K
% 0.99/1.35 pair_index ( 40) 2 0 2 0 0.1 K
% 0.99/1.35
% 0.99/1.35 -------------- statistics -------------
% 0.99/1.35 Clauses input 4
% 0.99/1.35 Usable input 0
% 0.99/1.35 Sos input 4
% 0.99/1.35 Demodulators input 0
% 0.99/1.35 Passive input 0
% 0.99/1.35
% 0.99/1.35 Processed BS (before search) 6
% 0.99/1.35 Forward subsumed BS 2
% 0.99/1.35 Kept BS 4
% 0.99/1.35 New demodulators BS 1
% 0.99/1.35 Back demodulated BS 0
% 0.99/1.35
% 0.99/1.35 Clauses or pairs given 3400
% 0.99/1.35 Clauses generated 7870
% 0.99/1.35 Forward subsumed 6851
% 0.99/1.35 Deleted by weight 0
% 0.99/1.35 Deleted by variable count 0
% 0.99/1.35 Kept 1019
% 0.99/1.35 New demodulators 544
% 0.99/1.35 Back demodulated 407
% 0.99/1.35 Ordered paramod prunes 0
% 0.99/1.35 Basic paramod prunes 6892
% 0.99/1.35 Prime paramod prunes 681
% 0.99/1.35 Semantic prunes 0
% 0.99/1.35
% 0.99/1.35 Rewrite attmepts 66263
% 0.99/1.35 Rewrites 8699
% 0.99/1.35
% 0.99/1.35 FPA overloads 0
% 0.99/1.35 FPA underloads 0
% 0.99/1.35
% 0.99/1.35 Usable size 0
% 0.99/1.35 Sos size 615
% 0.99/1.35 Demodulators size 357
% 0.99/1.35 Passive size 0
% 0.99/1.35 Disabled size 407
% 0.99/1.35
% 0.99/1.35 Proofs found 1
% 0.99/1.35
% 0.99/1.35 ----------- times (seconds) ----------- Wed Jun 8 13:13:24 2022
% 0.99/1.35
% 0.99/1.35 user CPU time 0.12 (0 hr, 0 min, 0 sec)
% 0.99/1.35 system CPU time 0.13 (0 hr, 0 min, 0 sec)
% 0.99/1.35 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.99/1.35 input time 0.00
% 0.99/1.35 paramodulation time 0.03
% 0.99/1.35 demodulation time 0.01
% 0.99/1.35 orient time 0.02
% 0.99/1.35 weigh time 0.00
% 0.99/1.35 forward subsume time 0.01
% 0.99/1.35 back demod find time 0.01
% 0.99/1.35 conflict time 0.00
% 0.99/1.35 LRPO time 0.01
% 0.99/1.35 store clause time 0.01
% 0.99/1.35 disable clause time 0.00
% 0.99/1.35 prime paramod time 0.01
% 0.99/1.35 semantics time 0.00
% 0.99/1.35
% 0.99/1.35 EQP interrupted
%------------------------------------------------------------------------------