TSTP Solution File: COL011-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : COL011-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n017.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 : Fri Jul 15 00:23:11 EDT 2022
% Result : Unsatisfiable 0.70s 1.13s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 5 RR)
% Number of literals : 11 ( 0 equ; 4 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 : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(apply(apply(o,A),B),apply(B,apply(A,B))),
file('COL011-1.p',unknown),
[] ).
cnf(2,plain,
equal(apply(A,apply(B,A)),apply(apply(o,B),A)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(apply(apply(apply(q1,A),B),C),apply(A,apply(C,B))),
file('COL011-1.p',unknown),
[] ).
cnf(4,plain,
equal(apply(A,apply(B,C)),apply(apply(apply(q1,A),C),B)),
inference(flip,[status(thm),theory(equality)],[3]),
[iquote('flip(3)')] ).
cnf(5,plain,
~ equal(apply(combinator,A),A),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(7,plain,
~ equal(apply(apply(apply(q1,combinator),A),B),apply(B,A)),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(21,plain,
equal(apply(A,apply(apply(B,apply(apply(q1,A),C)),C)),apply(apply(o,B),apply(apply(q1,A),C))),
inference(para,[status(thm),theory(equality)],[3,2]),
[iquote('para(3,2)')] ).
cnf(55,plain,
~ equal(apply(apply(apply(apply(q1,apply(q1,combinator)),A),B),C),apply(C,apply(B,A))),
inference(para,[status(thm),theory(equality)],[4,7]),
[iquote('para(4,7)')] ).
cnf(56,plain,
~ equal(apply(A,apply(B,C)),apply(apply(apply(apply(q1,apply(q1,combinator)),C),B),A)),
inference(flip,[status(thm),theory(equality)],[55]),
[iquote('flip(55)')] ).
cnf(484,plain,
equal(apply(apply(apply(apply(o,A),apply(apply(q1,q1),B)),C),D),apply(apply(apply(A,apply(apply(q1,q1),B)),B),apply(D,C))),
inference(para,[status(thm),theory(equality)],[21,3]),
[iquote('para(21,3)')] ).
cnf(485,plain,
$false,
inference(conflict,[status(thm)],[484,56]),
[iquote('conflict(484,56)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : COL011-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n017.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 : Tue May 31 07:51:41 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.70/1.13 ----- EQP 0.9e, May 2009 -----
% 0.70/1.13 The job began on n017.cluster.edu, Tue May 31 07:51:41 2022
% 0.70/1.13 The command was "./eqp09e".
% 0.70/1.13
% 0.70/1.13 set(prolog_style_variables).
% 0.70/1.13 set(lrpo).
% 0.70/1.13 set(basic_paramod).
% 0.70/1.13 set(functional_subsume).
% 0.70/1.13 set(ordered_paramod).
% 0.70/1.13 set(prime_paramod).
% 0.70/1.13 set(para_pairs).
% 0.70/1.13 assign(pick_given_ratio,4).
% 0.70/1.13 clear(print_kept).
% 0.70/1.13 clear(print_new_demod).
% 0.70/1.13 clear(print_back_demod).
% 0.70/1.13 clear(print_given).
% 0.70/1.13 assign(max_mem,64000).
% 0.70/1.13 end_of_commands.
% 0.70/1.13
% 0.70/1.13 Usable:
% 0.70/1.13 end_of_list.
% 0.70/1.13
% 0.70/1.13 Sos:
% 0.70/1.13 0 (wt=-1) [] apply(apply(o,A),B) = apply(B,apply(A,B)).
% 0.70/1.13 0 (wt=-1) [] apply(apply(apply(q1,A),B),C) = apply(A,apply(C,B)).
% 0.70/1.13 0 (wt=-1) [] -(A = apply(combinator,A)).
% 0.70/1.13 end_of_list.
% 0.70/1.13
% 0.70/1.13 Demodulators:
% 0.70/1.13 end_of_list.
% 0.70/1.13
% 0.70/1.13 Passive:
% 0.70/1.13 end_of_list.
% 0.70/1.13
% 0.70/1.13 Starting to process input.
% 0.70/1.13
% 0.70/1.13 ** KEPT: 1 (wt=11) [] apply(apply(o,A),B) = apply(B,apply(A,B)).
% 0.70/1.13
% 0.70/1.13 ** KEPT: 2 (wt=11) [flip(1)] apply(A,apply(B,A)) = apply(apply(o,B),A).
% 0.70/1.13 clause forward subsumed: 0 (wt=11) [flip(2)] apply(apply(o,B),A) = apply(A,apply(B,A)).
% 0.70/1.13
% 0.70/1.13 ** KEPT: 3 (wt=13) [] apply(apply(apply(q1,A),B),C) = apply(A,apply(C,B)).
% 0.70/1.13
% 0.70/1.13 ** KEPT: 4 (wt=13) [flip(3)] apply(A,apply(B,C)) = apply(apply(apply(q1,A),C),B).
% 0.70/1.13 clause forward subsumed: 0 (wt=13) [flip(4)] apply(apply(apply(q1,A),C),B) = apply(A,apply(B,C)).
% 0.70/1.13
% 0.70/1.13 ** KEPT: 5 (wt=5) [flip(1)] -(apply(combinator,A) = A).
% 0.70/1.13 ---------------- PROOF FOUND ----------------
% 0.70/1.13 % SZS status Unsatisfiable
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 After processing input:
% 0.70/1.13
% 0.70/1.13 Usable:
% 0.70/1.13 end_of_list.
% 0.70/1.13
% 0.70/1.13 Sos:
% 0.70/1.13 5 (wt=5) [flip(1)] -(apply(combinator,A) = A).
% 0.70/1.13 1 (wt=11) [] apply(apply(o,A),B) = apply(B,apply(A,B)).
% 0.70/1.13 2 (wt=11) [flip(1)] apply(A,apply(B,A)) = apply(apply(o,B),A).
% 0.70/1.13 3 (wt=13) [] apply(apply(apply(q1,A),B),C) = apply(A,apply(C,B)).
% 0.70/1.13 4 (wt=13) [flip(3)] apply(A,apply(B,C)) = apply(apply(apply(q1,A),C),B).
% 0.70/1.13 end_of_list.
% 0.70/1.13
% 0.70/1.13 Demodulators:
% 0.70/1.13 end_of_list.
% 0.70/1.13
% 0.70/1.13 Passive:
% 0.70/1.13 end_of_list.
% 0.70/1.13
% 0.70/1.13 UNIT CONFLICT from 484 and 56 at 0.04 seconds.
% 0.70/1.13
% 0.70/1.13 ---------------- PROOF ----------------
% 0.70/1.13 % SZS output start Refutation
% See solution above
% 0.70/1.13 ------------ end of proof -------------
% 0.70/1.13
% 0.70/1.13
% 0.70/1.13 ------------- memory usage ------------
% 0.70/1.13 Memory dynamically allocated (tp_alloc): 976.
% 0.70/1.13 type (bytes each) gets frees in use avail bytes
% 0.70/1.13 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.70/1.13 term ( 16) 24452 12800 11652 28 226.2 K
% 0.70/1.13 gen_ptr ( 8) 50953 1159 49794 10 389.1 K
% 0.70/1.13 context ( 808) 20875 20873 2 2 3.2 K
% 0.70/1.13 trail ( 12) 10266 10266 0 6 0.1 K
% 0.70/1.13 bt_node ( 68) 4774 4771 3 10 0.9 K
% 0.70/1.13 ac_position (285432) 0 0 0 0 0.0 K
% 0.70/1.13 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.70/1.13 ac_match_free_vars_pos (4020)
% 0.70/1.13 0 0 0 0 0.0 K
% 0.70/1.13 discrim ( 12) 8518 124 8394 0 98.4 K
% 0.70/1.13 flat ( 40) 70442 70442 0 53 2.1 K
% 0.70/1.13 discrim_pos ( 12) 347 347 0 1 0.0 K
% 0.70/1.13 fpa_head ( 12) 1069 0 1069 0 12.5 K
% 0.70/1.13 fpa_tree ( 28) 14632 14632 0 57 1.6 K
% 0.70/1.13 fpa_pos ( 36) 540 540 0 1 0.0 K
% 0.70/1.13 literal ( 12) 1449 965 484 1 5.7 K
% 0.70/1.13 clause ( 24) 1449 965 484 1 11.4 K
% 0.70/1.13 list ( 12) 115 59 56 3 0.7 K
% 0.70/1.13 list_pos ( 20) 1518 24 1494 0 29.2 K
% 0.70/1.13 pair_index ( 40) 2 0 2 0 0.1 K
% 0.70/1.13
% 0.70/1.13 -------------- statistics -------------
% 0.70/1.13 Clauses input 3
% 0.70/1.13 Usable input 0
% 0.70/1.13 Sos input 3
% 0.70/1.13 Demodulators input 0
% 0.70/1.13 Passive input 0
% 0.70/1.13
% 0.70/1.13 Processed BS (before search) 7
% 0.70/1.13 Forward subsumed BS 2
% 0.70/1.13 Kept BS 5
% 0.70/1.13 New demodulators BS 0
% 0.70/1.13 Back demodulated BS 0
% 0.70/1.13
% 0.70/1.13 Clauses or pairs given 730
% 0.70/1.13 Clauses generated 808
% 0.70/1.13 Forward subsumed 329
% 0.70/1.13 Deleted by weight 0
% 0.70/1.13 Deleted by variable count 0
% 0.70/1.13 Kept 479
% 0.70/1.13 New demodulators 56
% 0.70/1.13 Back demodulated 5
% 0.70/1.13 Ordered paramod prunes 0
% 0.70/1.13 Basic paramod prunes 835
% 0.70/1.13 Prime paramod prunes 0
% 0.70/1.13 Semantic prunes 0
% 0.70/1.13
% 0.70/1.13 Rewrite attmepts 13939
% 0.70/1.13 Rewrites 38
% 0.70/1.13
% 0.70/1.13 FPA overloads 0
% 0.70/1.13 FPA underloads 0
% 0.70/1.13
% 0.70/1.13 Usable size 0
% 0.70/1.13 Sos size 478
% 0.70/1.13 Demodulators size 55
% 0.70/1.13 Passive size 0
% 0.70/1.13 Disabled size 5
% 0.70/1.13
% 0.70/1.13 Proofs found 1
% 0.70/1.13
% 0.70/1.13 ----------- times (seconds) ----------- Tue May 31 07:51:41 2022
% 0.70/1.13
% 0.70/1.13 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.70/1.13 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.70/1.13 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.70/1.13 input time 0.00
% 0.70/1.13 paramodulation time 0.01
% 0.70/1.13 demodulation time 0.00
% 0.70/1.13 orient time 0.01
% 0.70/1.13 weigh time 0.00
% 0.70/1.13 forward subsume time 0.00
% 0.70/1.13 back demod find time 0.00
% 0.70/1.13 conflict time 0.01
% 0.70/1.13 LRPO time 0.00
% 0.70/1.13 store clause time 0.00
% 0.70/1.13 disable clause time 0.00
% 0.70/1.13 prime paramod time 0.00
% 0.70/1.13 semantics time 0.00
% 0.70/1.13
% 0.70/1.13 EQP interrupted
%------------------------------------------------------------------------------