TSTP Solution File: LCL113-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL113-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n020.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:06 EDT 2022
% Result : Unsatisfiable 0.55s 0.99s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of clauses : 30 ( 30 unt; 0 nHn; 4 RR)
% Number of literals : 30 ( 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(implies(truth,A),A),
file('LCL113-2.p',unknown),
[] ).
cnf(2,plain,
equal(implies(implies(A,B),implies(implies(B,C),implies(A,C))),truth),
file('LCL113-2.p',unknown),
[] ).
cnf(3,plain,
equal(implies(implies(A,B),B),implies(implies(B,A),A)),
file('LCL113-2.p',unknown),
[] ).
cnf(4,plain,
equal(implies(implies(not(A),not(B)),implies(B,A)),truth),
file('LCL113-2.p',unknown),
[] ).
cnf(5,plain,
~ equal(implies(implies(not(x),y),implies(not(y),x)),truth),
file('LCL113-2.p',unknown),
[] ).
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(implies(not(A),not(truth)),A),truth),
inference(para,[status(thm),theory(equality)],[1,4]),
[iquote('para(1,4)')] ).
cnf(8,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(9,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(10,plain,
equal(implies(A,A),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,8]),1]),
[iquote('para(1,8),demod([1])')] ).
cnf(11,plain,
equal(implies(implies(A,truth),truth),truth),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[6]),10]),
[iquote('back_demod(6),demod([10])')] ).
cnf(18,plain,
equal(implies(implies(implies(A,B),C),implies(implies(C,B),implies(implies(B,A),A))),truth),
inference(para,[status(thm),theory(equality)],[3,2]),
[iquote('para(3,2)')] ).
cnf(20,plain,
equal(implies(A,truth),truth),
inference(para,[status(thm),theory(equality)],[11,8]),
[iquote('para(11,8)')] ).
cnf(21,plain,
equal(implies(A,implies(B,A)),truth),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[9]),20,1]),
[iquote('back_demod(9),demod([20,1])')] ).
cnf(22,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]),21,1]),
[iquote('para(3,3),demod([21,1])')] ).
cnf(30,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)],[7,3]),1]),1]),
[iquote('para(7,3),demod([1]),flip(1)')] ).
cnf(34,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)],[7,22]),1]),1]),
[iquote('para(7,22),demod([1]),flip(1)')] ).
cnf(50,plain,
equal(implies(implies(implies(A,B),C),implies(B,C)),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[21,2]),1]),
[iquote('para(21,2),demod([1])')] ).
cnf(57,plain,
equal(implies(not(truth),A),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,50]),1]),
[iquote('para(7,50),demod([1])')] ).
cnf(58,plain,
equal(not(not(truth)),truth),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[34]),57]),1]),
[iquote('back_demod(34),demod([57]),flip(1)')] ).
cnf(69,plain,
equal(implies(not(A),implies(A,not(truth))),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[58,4]),1]),
[iquote('para(58,4),demod([1])')] ).
cnf(124,plain,
equal(implies(implies(implies(A,not(truth)),not(A)),not(A)),implies(A,not(truth))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[69,3]),1]),1]),
[iquote('para(69,3),demod([1]),flip(1)')] ).
cnf(125,plain,
equal(implies(implies(A,not(truth)),not(A)),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,18]),57,1,1]),
[iquote('para(7,18),demod([57,1,1])')] ).
cnf(126,plain,
equal(not(A),implies(A,not(truth))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[124]),125,1]),
[iquote('back_demod(124),demod([125,1])')] ).
cnf(127,plain,
equal(implies(A,not(truth)),not(A)),
inference(flip,[status(thm),theory(equality)],[126]),
[iquote('flip(126)')] ).
cnf(155,plain,
equal(implies(A,implies(not(A),not(truth))),truth),
inference(para,[status(thm),theory(equality)],[127,8]),
[iquote('para(127,8)')] ).
cnf(158,plain,
equal(implies(not(A),not(truth)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[30]),155,1]),
[iquote('back_demod(30),demod([155,1])')] ).
cnf(161,plain,
equal(not(not(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[158,127]),1]),
[iquote('para(158,127),flip(1)')] ).
cnf(176,plain,
equal(implies(implies(not(A),B),implies(not(B),A)),truth),
inference(para,[status(thm),theory(equality)],[161,4]),
[iquote('para(161,4)')] ).
cnf(177,plain,
$false,
inference(conflict,[status(thm)],[176,5]),
[iquote('conflict(176,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : LCL113-2 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.07 % Command : tptp2X_and_run_eqp %s
% 0.06/0.25 % Computer : n020.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 600
% 0.06/0.25 % DateTime : Sat Jul 2 23:38:15 EDT 2022
% 0.06/0.25 % CPUTime :
% 0.55/0.99 ----- EQP 0.9e, May 2009 -----
% 0.55/0.99 The job began on n020.cluster.edu, Sat Jul 2 23:38:15 2022
% 0.55/0.99 The command was "./eqp09e".
% 0.55/0.99
% 0.55/0.99 set(prolog_style_variables).
% 0.55/0.99 set(lrpo).
% 0.55/0.99 set(basic_paramod).
% 0.55/0.99 set(functional_subsume).
% 0.55/0.99 set(ordered_paramod).
% 0.55/0.99 set(prime_paramod).
% 0.55/0.99 set(para_pairs).
% 0.55/0.99 assign(pick_given_ratio,4).
% 0.55/0.99 clear(print_kept).
% 0.55/0.99 clear(print_new_demod).
% 0.55/0.99 clear(print_back_demod).
% 0.55/0.99 clear(print_given).
% 0.55/0.99 assign(max_mem,64000).
% 0.55/0.99 end_of_commands.
% 0.55/0.99
% 0.55/0.99 Usable:
% 0.55/0.99 end_of_list.
% 0.55/0.99
% 0.55/0.99 Sos:
% 0.55/0.99 0 (wt=-1) [] implies(truth,A) = A.
% 0.55/0.99 0 (wt=-1) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.55/0.99 0 (wt=-1) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.55/0.99 0 (wt=-1) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.55/0.99 0 (wt=-1) [] -(implies(implies(not(x),y),implies(not(y),x)) = truth).
% 0.55/0.99 end_of_list.
% 0.55/0.99
% 0.55/0.99 Demodulators:
% 0.55/0.99 end_of_list.
% 0.55/0.99
% 0.55/0.99 Passive:
% 0.55/0.99 end_of_list.
% 0.55/0.99
% 0.55/0.99 Starting to process input.
% 0.55/0.99
% 0.55/0.99 ** KEPT: 1 (wt=5) [] implies(truth,A) = A.
% 0.55/0.99 1 is a new demodulator.
% 0.55/0.99
% 0.55/0.99 ** KEPT: 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.55/0.99 2 is a new demodulator.
% 0.55/0.99
% 0.55/0.99 ** KEPT: 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.55/0.99 clause forward subsumed: 0 (wt=11) [flip(3)] implies(implies(B,A),A) = implies(implies(A,B),B).
% 0.55/0.99
% 0.55/0.99 ** KEPT: 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.55/0.99 4 is a new demodulator.
% 0.55/0.99
% 0.55/0.99 ** KEPT: 5 (wt=11) [] -(implies(implies(not(x),y),implies(not(y),x)) = truth).
% 0.55/0.99 ---------------- PROOF FOUND ----------------
% 0.55/0.99 % SZS status Unsatisfiable
% 0.55/0.99
% 0.55/0.99
% 0.55/0.99 After processing input:
% 0.55/0.99
% 0.55/0.99 Usable:
% 0.55/0.99 end_of_list.
% 0.55/0.99
% 0.55/0.99 Sos:
% 0.55/0.99 1 (wt=5) [] implies(truth,A) = A.
% 0.55/0.99 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.55/0.99 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.55/0.99 5 (wt=11) [] -(implies(implies(not(x),y),implies(not(y),x)) = truth).
% 0.55/0.99 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.55/0.99 end_of_list.
% 0.55/0.99
% 0.55/0.99 Demodulators:
% 0.55/0.99 1 (wt=5) [] implies(truth,A) = A.
% 0.55/0.99 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.55/0.99 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.55/0.99 end_of_list.
% 0.55/0.99
% 0.55/0.99 Passive:
% 0.55/0.99 end_of_list.
% 0.55/0.99
% 0.55/0.99 UNIT CONFLICT from 176 and 5 at 0.01 seconds.
% 0.55/0.99
% 0.55/0.99 ---------------- PROOF ----------------
% 0.55/0.99 % SZS output start Refutation
% See solution above
% 0.55/0.99 ------------ end of proof -------------
% 0.55/0.99
% 0.55/0.99
% 0.55/0.99 ------------- memory usage ------------
% 0.55/0.99 Memory dynamically allocated (tp_alloc): 488.
% 0.55/0.99 type (bytes each) gets frees in use avail bytes
% 0.55/0.99 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.55/0.99 term ( 16) 23721 20196 3525 33 68.8 K
% 0.55/0.99 gen_ptr ( 8) 21396 5178 16218 29 126.9 K
% 0.55/0.99 context ( 808) 16770 16768 2 2 3.2 K
% 0.55/0.99 trail ( 12) 1400 1400 0 6 0.1 K
% 0.55/0.99 bt_node ( 68) 6528 6526 2 15 1.1 K
% 0.55/0.99 ac_position (285432) 0 0 0 0 0.0 K
% 0.55/0.99 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.55/0.99 ac_match_free_vars_pos (4020)
% 0.55/0.99 0 0 0 0 0.0 K
% 0.55/0.99 discrim ( 12) 3980 381 3599 0 42.2 K
% 0.55/0.99 flat ( 40) 42929 42929 0 37 1.4 K
% 0.55/0.99 discrim_pos ( 12) 1429 1429 0 1 0.0 K
% 0.55/0.99 fpa_head ( 12) 676 0 676 0 7.9 K
% 0.55/0.99 fpa_tree ( 28) 1055 1055 0 17 0.5 K
% 0.55/0.99 fpa_pos ( 36) 347 347 0 1 0.0 K
% 0.55/0.99 literal ( 12) 1011 835 176 1 2.1 K
% 0.55/0.99 clause ( 24) 1011 835 176 1 4.1 K
% 0.55/0.99 list ( 12) 230 174 56 3 0.7 K
% 0.55/0.99 list_pos ( 20) 761 155 606 0 11.8 K
% 0.55/0.99 pair_index ( 40) 2 0 2 0 0.1 K
% 0.55/0.99
% 0.55/0.99 -------------- statistics -------------
% 0.55/0.99 Clauses input 5
% 0.55/0.99 Usable input 0
% 0.55/0.99 Sos input 5
% 0.55/0.99 Demodulators input 0
% 0.55/0.99 Passive input 0
% 0.55/0.99
% 0.55/0.99 Processed BS (before search) 6
% 0.55/0.99 Forward subsumed BS 1
% 0.55/0.99 Kept BS 5
% 0.55/0.99 New demodulators BS 3
% 0.55/0.99 Back demodulated BS 0
% 0.55/0.99
% 0.55/0.99 Clauses or pairs given 449
% 0.55/0.99 Clauses generated 822
% 0.55/0.99 Forward subsumed 651
% 0.55/0.99 Deleted by weight 0
% 0.55/0.99 Deleted by variable count 0
% 0.55/0.99 Kept 171
% 0.55/0.99 New demodulators 168
% 0.55/0.99 Back demodulated 30
% 0.55/0.99 Ordered paramod prunes 0
% 0.55/0.99 Basic paramod prunes 728
% 0.55/0.99 Prime paramod prunes 75
% 0.55/0.99 Semantic prunes 0
% 0.55/0.99
% 0.55/0.99 Rewrite attmepts 8755
% 0.55/0.99 Rewrites 1348
% 0.55/0.99
% 0.55/0.99 FPA overloads 0
% 0.55/0.99 FPA underloads 0
% 0.55/0.99
% 0.55/0.99 Usable size 0
% 0.55/0.99 Sos size 145
% 0.55/0.99 Demodulators size 141
% 0.55/0.99 Passive size 0
% 0.55/0.99 Disabled size 30
% 0.55/0.99
% 0.55/0.99 Proofs found 1
% 0.55/0.99
% 0.55/0.99 ----------- times (seconds) ----------- Sat Jul 2 23:38:15 2022
% 0.55/0.99
% 0.55/0.99 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.55/0.99 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.55/0.99 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.55/0.99 input time 0.00
% 0.55/0.99 paramodulation time 0.00
% 0.55/0.99 demodulation time 0.00
% 0.55/0.99 orient time 0.00
% 0.55/0.99 weigh time 0.00
% 0.55/0.99 forward subsume time 0.00
% 0.55/0.99 back demod find time 0.00
% 0.55/0.99 conflict time 0.00
% 0.55/0.99 LRPO time 0.00
% 0.55/0.99 store clause time 0.00
% 0.55/0.99 disable clause time 0.00
% 0.55/0.99 prime paramod time 0.00
% 0.55/0.99 semantics time 0.00
% 0.55/0.99
% 0.55/0.99 EQP interrupted
%------------------------------------------------------------------------------