TSTP Solution File: BOO075-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO075-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n027.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 23:37:34 EDT 2022
% Result : Unsatisfiable 0.72s 1.21s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 2 RR)
% Number of literals : 27 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 58 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(nand(nand(A,nand(nand(B,A),A)),nand(B,nand(C,A))),B),
file('BOO075-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(nand(nand(a,a),nand(b,a)),a),
file('BOO075-1.p',unknown),
[] ).
cnf(4,plain,
equal(nand(nand(nand(A,nand(B,C)),nand(nand(D,nand(A,nand(B,C))),nand(A,nand(B,C)))),nand(D,A)),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(5,plain,
equal(nand(nand(nand(A,B),nand(nand(nand(B,nand(nand(C,B),B)),nand(A,B)),nand(A,B))),C),nand(B,nand(nand(C,B),B))),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(11,plain,
equal(nand(nand(nand(A,B),nand(nand(C,nand(A,B)),nand(A,B))),nand(C,A)),C),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(19,plain,
equal(nand(nand(A,nand(nand(B,A),A)),nand(B,nand(C,nand(nand(A,C),C)))),B),
inference(para,[status(thm),theory(equality)],[5,1]),
[iquote('para(5,1)')] ).
cnf(25,plain,
equal(nand(nand(A,nand(nand(nand(B,nand(nand(B,B),B)),A),A)),B),nand(B,nand(nand(B,B),B))),
inference(para,[status(thm),theory(equality)],[1,19]),
[iquote('para(1,19)')] ).
cnf(31,plain,
equal(nand(nand(nand(A,nand(B,A)),nand(A,nand(A,nand(B,A)))),A),nand(A,nand(nand(A,A),A))),
inference(para,[status(thm),theory(equality)],[1,25]),
[iquote('para(1,25)')] ).
cnf(32,plain,
equal(nand(nand(A,nand(nand(A,nand(nand(A,A),A)),A)),nand(nand(B,nand(nand(nand(A,nand(nand(A,A),A)),B),B)),nand(C,A))),nand(B,nand(nand(nand(A,nand(nand(A,A),A)),B),B))),
inference(para,[status(thm),theory(equality)],[25,1]),
[iquote('para(25,1)')] ).
cnf(47,plain,
equal(nand(A,nand(nand(A,A),A)),nand(A,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,31]),1]),
[iquote('para(19,31),flip(1)')] ).
cnf(61,plain,
equal(nand(nand(A,A),nand(nand(B,nand(nand(nand(A,A),B),B)),nand(C,A))),nand(B,nand(nand(nand(A,A),B),B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[32]),47,47,47,47]),
[iquote('back_demod(32),demod([47,47,47,47])')] ).
cnf(62,plain,
equal(nand(nand(nand(A,nand(B,A)),nand(A,nand(A,nand(B,A)))),A),nand(A,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[31]),47]),
[iquote('back_demod(31),demod([47])')] ).
cnf(63,plain,
equal(nand(nand(A,nand(nand(nand(B,B),A),A)),B),nand(B,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[25]),47,47]),
[iquote('back_demod(25),demod([47,47])')] ).
cnf(67,plain,
equal(nand(nand(A,A),nand(A,nand(B,A))),A),
inference(para,[status(thm),theory(equality)],[47,1]),
[iquote('para(47,1)')] ).
cnf(68,plain,
equal(nand(nand(A,A),nand(A,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[47,1]),47]),
[iquote('para(47,1),demod([47])')] ).
cnf(70,plain,
equal(nand(A,nand(nand(A,A),nand(B,nand(A,A)))),nand(A,A)),
inference(para,[status(thm),theory(equality)],[68,67]),
[iquote('para(68,67)')] ).
cnf(74,plain,
equal(nand(nand(A,nand(nand(B,A),A)),nand(B,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[68,63]),68]),
[iquote('para(68,63),demod([68])')] ).
cnf(86,plain,
equal(nand(nand(nand(nand(A,A),nand(B,nand(A,A))),nand(nand(A,A),nand(nand(A,A),nand(B,nand(A,A))))),nand(A,nand(C,nand(nand(A,A),nand(B,nand(A,A)))))),A),
inference(para,[status(thm),theory(equality)],[70,1]),
[iquote('para(70,1)')] ).
cnf(95,plain,
equal(nand(nand(nand(A,nand(B,A)),nand(A,nand(A,nand(B,A)))),nand(nand(A,A),A)),nand(A,A)),
inference(para,[status(thm),theory(equality)],[67,11]),
[iquote('para(67,11)')] ).
cnf(100,plain,
equal(nand(A,nand(nand(B,nand(nand(A,B),B)),A)),nand(B,nand(nand(A,B),B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[74,11]),67]),
[iquote('para(74,11),demod([67])')] ).
cnf(105,plain,
equal(nand(nand(A,A),nand(B,nand(nand(A,B),B))),A),
inference(para,[status(thm),theory(equality)],[100,67]),
[iquote('para(100,67)')] ).
cnf(301,plain,
equal(nand(nand(A,nand(B,A)),nand(A,nand(A,nand(B,A)))),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[95,1]),62,47,68]),1]),
[iquote('para(95,1),demod([62,47,68]),flip(1)')] ).
cnf(307,plain,
equal(nand(nand(A,A),nand(A,nand(B,nand(nand(A,A),nand(C,nand(A,A)))))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[86]),301]),
[iquote('back_demod(86),demod([301])')] ).
cnf(332,plain,
equal(nand(nand(A,A),nand(A,B)),A),
inference(para,[status(thm),theory(equality)],[105,307]),
[iquote('para(105,307)')] ).
cnf(527,plain,
equal(nand(A,nand(nand(nand(nand(B,A),nand(B,A)),A),A)),nand(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,61]),332]),1]),
[iquote('para(1,61),demod([332]),flip(1)')] ).
cnf(528,plain,
equal(nand(nand(A,A),nand(B,A)),A),
inference(para,[status(thm),theory(equality)],[527,332]),
[iquote('para(527,332)')] ).
cnf(529,plain,
$false,
inference(conflict,[status(thm)],[528,2]),
[iquote('conflict(528,2)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : BOO075-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 1 20:34:19 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.72/1.21 ----- EQP 0.9e, May 2009 -----
% 0.72/1.21 The job began on n027.cluster.edu, Wed Jun 1 20:34:19 2022
% 0.72/1.21 The command was "./eqp09e".
% 0.72/1.21
% 0.72/1.21 set(prolog_style_variables).
% 0.72/1.21 set(lrpo).
% 0.72/1.21 set(basic_paramod).
% 0.72/1.21 set(functional_subsume).
% 0.72/1.21 set(ordered_paramod).
% 0.72/1.21 set(prime_paramod).
% 0.72/1.21 set(para_pairs).
% 0.72/1.21 assign(pick_given_ratio,4).
% 0.72/1.21 clear(print_kept).
% 0.72/1.21 clear(print_new_demod).
% 0.72/1.21 clear(print_back_demod).
% 0.72/1.21 clear(print_given).
% 0.72/1.21 assign(max_mem,64000).
% 0.72/1.21 end_of_commands.
% 0.72/1.21
% 0.72/1.21 Usable:
% 0.72/1.21 end_of_list.
% 0.72/1.21
% 0.72/1.21 Sos:
% 0.72/1.21 0 (wt=-1) [] nand(nand(A,nand(nand(B,A),A)),nand(B,nand(C,A))) = B.
% 0.72/1.21 0 (wt=-1) [] -(nand(nand(a,a),nand(b,a)) = a).
% 0.72/1.21 end_of_list.
% 0.72/1.21
% 0.72/1.21 Demodulators:
% 0.72/1.21 end_of_list.
% 0.72/1.21
% 0.72/1.21 Passive:
% 0.72/1.21 end_of_list.
% 0.72/1.21
% 0.72/1.21 Starting to process input.
% 0.72/1.21
% 0.72/1.21 ** KEPT: 1 (wt=15) [] nand(nand(A,nand(nand(B,A),A)),nand(B,nand(C,A))) = B.
% 0.72/1.21 1 is a new demodulator.
% 0.72/1.21
% 0.72/1.21 ** KEPT: 2 (wt=9) [] -(nand(nand(a,a),nand(b,a)) = a).
% 0.72/1.21 ---------------- PROOF FOUND ----------------
% 0.72/1.21 % SZS status Unsatisfiable
% 0.72/1.21
% 0.72/1.21
% 0.72/1.21 After processing input:
% 0.72/1.21
% 0.72/1.21 Usable:
% 0.72/1.21 end_of_list.
% 0.72/1.21
% 0.72/1.21 Sos:
% 0.72/1.21 2 (wt=9) [] -(nand(nand(a,a),nand(b,a)) = a).
% 0.72/1.21 1 (wt=15) [] nand(nand(A,nand(nand(B,A),A)),nand(B,nand(C,A))) = B.
% 0.72/1.21 end_of_list.
% 0.72/1.21
% 0.72/1.21 Demodulators:
% 0.72/1.21 1 (wt=15) [] nand(nand(A,nand(nand(B,A),A)),nand(B,nand(C,A))) = B.
% 0.72/1.21 end_of_list.
% 0.72/1.21
% 0.72/1.21 Passive:
% 0.72/1.21 end_of_list.
% 0.72/1.21
% 0.72/1.21 UNIT CONFLICT from 528 and 2 at 0.11 seconds.
% 0.72/1.21
% 0.72/1.21 ---------------- PROOF ----------------
% 0.72/1.21 % SZS output start Refutation
% See solution above
% 0.72/1.21 ------------ end of proof -------------
% 0.72/1.21
% 0.72/1.21
% 0.72/1.21 ------------- memory usage ------------
% 0.72/1.21 Memory dynamically allocated (tp_alloc): 2441.
% 0.72/1.21 type (bytes each) gets frees in use avail bytes
% 0.72/1.21 sym_ent ( 96) 54 0 54 0 5.1 K
% 0.72/1.21 term ( 16) 170559 144899 25660 195 502.9 K
% 0.72/1.21 gen_ptr ( 8) 183131 36391 146740 26 1146.6 K
% 0.72/1.21 context ( 808) 90645 90643 2 3 3.9 K
% 0.72/1.21 trail ( 12) 41683 41683 0 6 0.1 K
% 0.72/1.21 bt_node ( 68) 45917 45914 3 116 7.9 K
% 0.72/1.21 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.21 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.21 ac_match_free_vars_pos (4020)
% 0.72/1.21 0 0 0 0 0.0 K
% 0.72/1.21 discrim ( 12) 27047 14414 12633 2467 177.0 K
% 0.72/1.21 flat ( 40) 626430 626430 0 131 5.1 K
% 0.72/1.21 discrim_pos ( 12) 3863 3863 0 1 0.0 K
% 0.72/1.21 fpa_head ( 12) 1585 0 1585 0 18.6 K
% 0.72/1.21 fpa_tree ( 28) 4781 4781 0 37 1.0 K
% 0.72/1.21 fpa_pos ( 36) 1052 1052 0 1 0.0 K
% 0.72/1.21 literal ( 12) 2449 1921 528 1 6.2 K
% 0.72/1.21 clause ( 24) 2449 1921 528 1 12.4 K
% 0.72/1.21 list ( 12) 583 527 56 3 0.7 K
% 0.72/1.21 list_pos ( 20) 2747 1594 1153 0 22.5 K
% 0.72/1.21 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.21
% 0.72/1.21 -------------- statistics -------------
% 0.72/1.21 Clauses input 2
% 0.72/1.21 Usable input 0
% 0.72/1.21 Sos input 2
% 0.72/1.21 Demodulators input 0
% 0.72/1.21 Passive input 0
% 0.72/1.21
% 0.72/1.21 Processed BS (before search) 2
% 0.72/1.21 Forward subsumed BS 0
% 0.72/1.21 Kept BS 2
% 0.72/1.21 New demodulators BS 1
% 0.72/1.21 Back demodulated BS 0
% 0.72/1.21
% 0.72/1.21 Clauses or pairs given 1267
% 0.72/1.21 Clauses generated 1846
% 0.72/1.21 Forward subsumed 1320
% 0.72/1.21 Deleted by weight 0
% 0.72/1.21 Deleted by variable count 0
% 0.72/1.21 Kept 526
% 0.72/1.21 New demodulators 523
% 0.72/1.21 Back demodulated 318
% 0.72/1.21 Ordered paramod prunes 0
% 0.72/1.21 Basic paramod prunes 8969
% 0.72/1.21 Prime paramod prunes 114
% 0.72/1.21 Semantic prunes 0
% 0.72/1.21
% 0.72/1.21 Rewrite attmepts 63321
% 0.72/1.21 Rewrites 3748
% 0.72/1.21
% 0.72/1.21 FPA overloads 0
% 0.72/1.21 FPA underloads 0
% 0.72/1.21
% 0.72/1.21 Usable size 0
% 0.72/1.21 Sos size 209
% 0.72/1.21 Demodulators size 208
% 0.72/1.21 Passive size 0
% 0.72/1.21 Disabled size 318
% 0.72/1.21
% 0.72/1.21 Proofs found 1
% 0.72/1.21
% 0.72/1.21 ----------- times (seconds) ----------- Wed Jun 1 20:34:20 2022
% 0.72/1.21
% 0.72/1.21 user CPU time 0.11 (0 hr, 0 min, 0 sec)
% 0.72/1.21 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.72/1.21 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 0.72/1.21 input time 0.00
% 0.72/1.21 paramodulation time 0.02
% 0.72/1.21 demodulation time 0.03
% 0.72/1.21 orient time 0.00
% 0.72/1.21 weigh time 0.00
% 0.72/1.21 forward subsume time 0.00
% 0.72/1.21 back demod find time 0.01
% 0.72/1.21 conflict time 0.00
% 0.72/1.21 LRPO time 0.00
% 0.72/1.21 store clause time 0.02
% 0.72/1.21 disable clause time 0.00
% 0.72/1.21 prime paramod time 0.01
% 0.72/1.21 semantics time 0.00
% 0.72/1.21
% 0.72/1.21 EQP interrupted
%------------------------------------------------------------------------------