TSTP Solution File: LCL139-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL139-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n009.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 : Sun Jul 17 09:41:16 EDT 2022
% Result : Unsatisfiable 0.71s 1.09s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 4 RR)
% Number of literals : 27 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(implies(truth,A),A),
file('LCL139-1.p',unknown),
[] ).
cnf(2,plain,
equal(implies(implies(A,B),implies(implies(B,C),implies(A,C))),truth),
file('LCL139-1.p',unknown),
[] ).
cnf(3,plain,
equal(implies(implies(A,B),B),implies(implies(B,A),A)),
file('LCL139-1.p',unknown),
[] ).
cnf(4,plain,
equal(implies(implies(not(A),not(B)),implies(B,A)),truth),
file('LCL139-1.p',unknown),
[] ).
cnf(5,plain,
~ equal(not(x),implies(x,not(truth))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(6,plain,
equal(implies(implies(A,truth),truth),implies(A,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,3]),1]),
[iquote('para(1,3),flip(1)')] ).
cnf(7,plain,
equal(implies(A,implies(implies(A,B),B)),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,2]),1]),
[iquote('para(1,2),demod([1])')] ).
cnf(8,plain,
equal(implies(implies(A,truth),implies(B,implies(A,B))),truth),
inference(para,[status(thm),theory(equality)],[1,2]),
[iquote('para(1,2)')] ).
cnf(9,plain,
equal(implies(A,A),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,7]),1]),
[iquote('para(1,7),demod([1])')] ).
cnf(10,plain,
equal(implies(implies(A,truth),truth),truth),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[6]),9]),
[iquote('back_demod(6),demod([9])')] ).
cnf(19,plain,
equal(implies(A,truth),truth),
inference(para,[status(thm),theory(equality)],[10,7]),
[iquote('para(10,7)')] ).
cnf(20,plain,
equal(implies(A,implies(B,A)),truth),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[8]),19,1]),
[iquote('back_demod(8),demod([19,1])')] ).
cnf(21,plain,
equal(implies(implies(implies(A,B),B),A),implies(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,3]),20,1]),
[iquote('para(3,3),demod([20,1])')] ).
cnf(22,plain,
equal(implies(implies(not(A),not(truth)),A),truth),
inference(para,[status(thm),theory(equality)],[1,4]),
[iquote('para(1,4)')] ).
cnf(41,plain,
equal(implies(implies(A,implies(not(A),not(truth))),implies(not(A),not(truth))),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,3]),1]),1]),
[iquote('para(22,3),demod([1]),flip(1)')] ).
cnf(44,plain,
equal(implies(not(truth),not(not(truth))),not(not(truth))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,21]),1]),1]),
[iquote('para(22,21),demod([1]),flip(1)')] ).
cnf(57,plain,
equal(implies(implies(implies(A,B),C),implies(B,C)),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,2]),1]),
[iquote('para(20,2),demod([1])')] ).
cnf(72,plain,
equal(implies(not(truth),A),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,57]),1]),
[iquote('para(22,57),demod([1])')] ).
cnf(73,plain,
equal(not(not(truth)),truth),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[44]),72]),1]),
[iquote('back_demod(44),demod([72]),flip(1)')] ).
cnf(78,plain,
equal(implies(not(A),implies(A,not(truth))),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[73,4]),1]),
[iquote('para(73,4),demod([1])')] ).
cnf(85,plain,
equal(implies(implies(A,not(truth)),not(truth)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[72,3]),1]),1]),
[iquote('para(72,3),demod([1]),flip(1)')] ).
cnf(91,plain,
equal(implies(not(implies(A,not(truth))),A),truth),
inference(para,[status(thm),theory(equality)],[85,78]),
[iquote('para(85,78)')] ).
cnf(157,plain,
equal(implies(A,implies(not(A),not(truth))),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[91,4]),1]),
[iquote('para(91,4),demod([1])')] ).
cnf(158,plain,
equal(implies(not(A),not(truth)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[41]),157,1]),
[iquote('back_demod(41),demod([157,1])')] ).
cnf(160,plain,
equal(implies(A,not(truth)),not(A)),
inference(para,[status(thm),theory(equality)],[158,85]),
[iquote('para(158,85)')] ).
cnf(161,plain,
equal(not(A),implies(A,not(truth))),
inference(flip,[status(thm),theory(equality)],[160]),
[iquote('flip(160)')] ).
cnf(162,plain,
$false,
inference(conflict,[status(thm)],[161,5]),
[iquote('conflict(161,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL139-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n009.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 : Mon Jul 4 23:22:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.09 ----- EQP 0.9e, May 2009 -----
% 0.71/1.09 The job began on n009.cluster.edu, Mon Jul 4 23:22:38 2022
% 0.71/1.09 The command was "./eqp09e".
% 0.71/1.09
% 0.71/1.09 set(prolog_style_variables).
% 0.71/1.09 set(lrpo).
% 0.71/1.09 set(basic_paramod).
% 0.71/1.09 set(functional_subsume).
% 0.71/1.09 set(ordered_paramod).
% 0.71/1.09 set(prime_paramod).
% 0.71/1.09 set(para_pairs).
% 0.71/1.09 assign(pick_given_ratio,4).
% 0.71/1.09 clear(print_kept).
% 0.71/1.09 clear(print_new_demod).
% 0.71/1.09 clear(print_back_demod).
% 0.71/1.09 clear(print_given).
% 0.71/1.09 assign(max_mem,64000).
% 0.71/1.09 end_of_commands.
% 0.71/1.09
% 0.71/1.09 Usable:
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Sos:
% 0.71/1.09 0 (wt=-1) [] implies(truth,A) = A.
% 0.71/1.09 0 (wt=-1) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.71/1.09 0 (wt=-1) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.71/1.09 0 (wt=-1) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.71/1.09 0 (wt=-1) [] -(implies(x,not(truth)) = not(x)).
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Demodulators:
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Passive:
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Starting to process input.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 1 (wt=5) [] implies(truth,A) = A.
% 0.71/1.09 1 is a new demodulator.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.71/1.09 2 is a new demodulator.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.71/1.09 clause forward subsumed: 0 (wt=11) [flip(3)] implies(implies(B,A),A) = implies(implies(A,B),B).
% 0.71/1.09
% 0.71/1.09 ** KEPT: 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.71/1.09 4 is a new demodulator.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 5 (wt=7) [flip(1)] -(not(x) = implies(x,not(truth))).
% 0.71/1.09 ---------------- PROOF FOUND ----------------
% 0.71/1.09 % SZS status Unsatisfiable
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 After processing input:
% 0.71/1.09
% 0.71/1.09 Usable:
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Sos:
% 0.71/1.09 1 (wt=5) [] implies(truth,A) = A.
% 0.71/1.09 5 (wt=7) [flip(1)] -(not(x) = implies(x,not(truth))).
% 0.71/1.09 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.71/1.09 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.71/1.09 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Demodulators:
% 0.71/1.09 1 (wt=5) [] implies(truth,A) = A.
% 0.71/1.09 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.71/1.09 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Passive:
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 UNIT CONFLICT from 161 and 5 at 0.01 seconds.
% 0.71/1.09
% 0.71/1.09 ---------------- PROOF ----------------
% 0.71/1.09 % SZS output start Refutation
% See solution above
% 0.71/1.09 ------------ end of proof -------------
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 ------------- memory usage ------------
% 0.71/1.09 Memory dynamically allocated (tp_alloc): 488.
% 0.71/1.09 type (bytes each) gets frees in use avail bytes
% 0.71/1.09 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.71/1.09 term ( 16) 22749 19439 3310 18 64.4 K
% 0.71/1.09 gen_ptr ( 8) 19814 4477 15337 26 120.0 K
% 0.71/1.09 context ( 808) 15512 15510 2 2 3.2 K
% 0.71/1.09 trail ( 12) 1527 1527 0 6 0.1 K
% 0.71/1.09 bt_node ( 68) 6054 6050 4 13 1.1 K
% 0.71/1.09 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.09 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.09 ac_match_free_vars_pos (4020)
% 0.71/1.09 0 0 0 0 0.0 K
% 0.71/1.09 discrim ( 12) 3776 134 3642 22 42.9 K
% 0.71/1.09 flat ( 40) 41129 41129 0 37 1.4 K
% 0.71/1.09 discrim_pos ( 12) 1349 1349 0 1 0.0 K
% 0.71/1.09 fpa_head ( 12) 645 0 645 0 7.6 K
% 0.71/1.09 fpa_tree ( 28) 952 952 0 17 0.5 K
% 0.71/1.09 fpa_pos ( 36) 318 318 0 1 0.0 K
% 0.71/1.09 literal ( 12) 941 780 161 1 1.9 K
% 0.71/1.09 clause ( 24) 941 780 161 1 3.8 K
% 0.71/1.09 list ( 12) 216 160 56 3 0.7 K
% 0.71/1.09 list_pos ( 20) 668 70 598 5 11.8 K
% 0.71/1.09 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.09
% 0.71/1.09 -------------- statistics -------------
% 0.71/1.09 Clauses input 5
% 0.71/1.09 Usable input 0
% 0.71/1.09 Sos input 5
% 0.71/1.09 Demodulators input 0
% 0.71/1.09 Passive input 0
% 0.71/1.09
% 0.71/1.09 Processed BS (before search) 6
% 0.71/1.09 Forward subsumed BS 1
% 0.71/1.09 Kept BS 5
% 0.71/1.09 New demodulators BS 3
% 0.71/1.09 Back demodulated BS 0
% 0.71/1.09
% 0.71/1.09 Clauses or pairs given 404
% 0.71/1.09 Clauses generated 771
% 0.71/1.09 Forward subsumed 615
% 0.71/1.09 Deleted by weight 0
% 0.71/1.09 Deleted by variable count 0
% 0.71/1.09 Kept 156
% 0.71/1.09 New demodulators 154
% 0.71/1.09 Back demodulated 13
% 0.71/1.09 Ordered paramod prunes 0
% 0.71/1.09 Basic paramod prunes 648
% 0.71/1.09 Prime paramod prunes 76
% 0.71/1.09 Semantic prunes 0
% 0.71/1.09
% 0.71/1.09 Rewrite attmepts 8224
% 0.71/1.09 Rewrites 1271
% 0.71/1.09
% 0.71/1.09 FPA overloads 0
% 0.71/1.09 FPA underloads 0
% 0.71/1.09
% 0.71/1.09 Usable size 0
% 0.71/1.09 Sos size 147
% 0.71/1.09 Demodulators size 144
% 0.71/1.09 Passive size 0
% 0.71/1.09 Disabled size 13
% 0.71/1.09
% 0.71/1.09 Proofs found 1
% 0.71/1.09
% 0.71/1.09 ----------- times (seconds) ----------- Mon Jul 4 23:22:38 2022
% 0.71/1.09
% 0.71/1.09 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.71/1.09 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.71/1.09 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.09 input time 0.00
% 0.71/1.09 paramodulation time 0.00
% 0.71/1.09 demodulation time 0.00
% 0.71/1.09 orient time 0.00
% 0.71/1.09 weigh time 0.00
% 0.71/1.09 forward subsume time 0.00
% 0.71/1.09 back demod find time 0.00
% 0.71/1.09 conflict time 0.00
% 0.71/1.09 LRPO time 0.00
% 0.71/1.09 store clause time 0.00
% 0.71/1.09 disable clause time 0.00
% 0.71/1.09 prime paramod time 0.00
% 0.71/1.09 semantics time 0.00
% 0.71/1.09
% 0.71/1.09 EQP interrupted
%------------------------------------------------------------------------------