TSTP Solution File: LCL115-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL115-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n028.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:07 EDT 2022
% Result : Unsatisfiable 0.72s 1.11s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 4 RR)
% Number of literals : 33 ( 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 : 45 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(implies(truth,A),A),
file('LCL115-2.p',unknown),
[] ).
cnf(2,plain,
equal(implies(implies(A,B),implies(implies(B,C),implies(A,C))),truth),
file('LCL115-2.p',unknown),
[] ).
cnf(3,plain,
equal(implies(implies(A,B),B),implies(implies(B,A),A)),
file('LCL115-2.p',unknown),
[] ).
cnf(4,plain,
equal(implies(implies(not(A),not(B)),implies(B,A)),truth),
file('LCL115-2.p',unknown),
[] ).
cnf(5,plain,
~ equal(implies(not(implies(a,b)),not(b)),truth),
file('LCL115-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(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(25,plain,
equal(implies(implies(implies(A,B),implies(not(B),not(A))),implies(not(B),not(A))),implies(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,3]),1]),1]),
[iquote('para(4,3),demod([1]),flip(1)')] ).
cnf(31,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(43,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(52,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(71,plain,
equal(implies(not(truth),A),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,52]),1]),
[iquote('para(22,52),demod([1])')] ).
cnf(72,plain,
equal(not(not(truth)),truth),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[43]),71]),1]),
[iquote('back_demod(43),demod([71]),flip(1)')] ).
cnf(77,plain,
equal(implies(not(A),implies(A,not(truth))),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[72,4]),1]),
[iquote('para(72,4),demod([1])')] ).
cnf(81,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)],[71,3]),1]),1]),
[iquote('para(71,3),demod([1]),flip(1)')] ).
cnf(89,plain,
equal(implies(not(implies(A,not(truth))),A),truth),
inference(para,[status(thm),theory(equality)],[81,77]),
[iquote('para(81,77)')] ).
cnf(154,plain,
equal(implies(A,implies(not(A),not(truth))),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[89,4]),1]),
[iquote('para(89,4),demod([1])')] ).
cnf(155,plain,
equal(implies(not(A),not(truth)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[31]),154,1]),
[iquote('back_demod(31),demod([154,1])')] ).
cnf(160,plain,
equal(implies(A,not(truth)),not(A)),
inference(para,[status(thm),theory(equality)],[155,81]),
[iquote('para(155,81)')] ).
cnf(162,plain,
equal(not(not(A)),A),
inference(para,[status(thm),theory(equality)],[160,155]),
[iquote('para(160,155)')] ).
cnf(187,plain,
equal(implies(implies(A,not(B)),implies(B,not(A))),truth),
inference(para,[status(thm),theory(equality)],[162,4]),
[iquote('para(162,4)')] ).
cnf(201,plain,
equal(implies(implies(A,B),implies(not(B),not(A))),truth),
inference(para,[status(thm),theory(equality)],[162,187]),
[iquote('para(162,187)')] ).
cnf(204,plain,
equal(implies(not(A),not(B)),implies(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[25]),201,1]),
[iquote('back_demod(25),demod([201,1])')] ).
cnf(205,plain,
equal(implies(A,B),implies(not(B),not(A))),
inference(flip,[status(thm),theory(equality)],[204]),
[iquote('flip(204)')] ).
cnf(236,plain,
equal(implies(not(implies(A,B)),not(B)),truth),
inference(para,[status(thm),theory(equality)],[205,20]),
[iquote('para(205,20)')] ).
cnf(237,plain,
$false,
inference(conflict,[status(thm)],[236,5]),
[iquote('conflict(236,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL115-2 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n028.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 : Sun Jul 3 14:06:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.72/1.10 ----- EQP 0.9e, May 2009 -----
% 0.72/1.10 The job began on n028.cluster.edu, Sun Jul 3 14:06:34 2022
% 0.72/1.10 The command was "./eqp09e".
% 0.72/1.10
% 0.72/1.10 set(prolog_style_variables).
% 0.72/1.10 set(lrpo).
% 0.72/1.10 set(basic_paramod).
% 0.72/1.10 set(functional_subsume).
% 0.72/1.10 set(ordered_paramod).
% 0.72/1.10 set(prime_paramod).
% 0.72/1.10 set(para_pairs).
% 0.72/1.10 assign(pick_given_ratio,4).
% 0.72/1.10 clear(print_kept).
% 0.72/1.10 clear(print_new_demod).
% 0.72/1.10 clear(print_back_demod).
% 0.72/1.10 clear(print_given).
% 0.72/1.10 assign(max_mem,64000).
% 0.72/1.10 end_of_commands.
% 0.72/1.10
% 0.72/1.10 Usable:
% 0.72/1.10 end_of_list.
% 0.72/1.10
% 0.72/1.10 Sos:
% 0.72/1.10 0 (wt=-1) [] implies(truth,A) = A.
% 0.72/1.10 0 (wt=-1) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.72/1.10 0 (wt=-1) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.72/1.10 0 (wt=-1) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.72/1.10 0 (wt=-1) [] -(implies(not(implies(a,b)),not(b)) = truth).
% 0.72/1.10 end_of_list.
% 0.72/1.10
% 0.72/1.10 Demodulators:
% 0.72/1.10 end_of_list.
% 0.72/1.10
% 0.72/1.10 Passive:
% 0.72/1.10 end_of_list.
% 0.72/1.10
% 0.72/1.10 Starting to process input.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 1 (wt=5) [] implies(truth,A) = A.
% 0.72/1.10 1 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.72/1.10 2 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.72/1.11 clause forward subsumed: 0 (wt=11) [flip(3)] implies(implies(B,A),A) = implies(implies(A,B),B).
% 0.72/1.11
% 0.72/1.11 ** KEPT: 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.72/1.11 4 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 5 (wt=9) [] -(implies(not(implies(a,b)),not(b)) = truth).
% 0.72/1.11 ---------------- PROOF FOUND ----------------
% 0.72/1.11 % SZS status Unsatisfiable
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 After processing input:
% 0.72/1.11
% 0.72/1.11 Usable:
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Sos:
% 0.72/1.11 1 (wt=5) [] implies(truth,A) = A.
% 0.72/1.11 5 (wt=9) [] -(implies(not(implies(a,b)),not(b)) = truth).
% 0.72/1.11 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.72/1.11 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.72/1.11 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Demodulators:
% 0.72/1.11 1 (wt=5) [] implies(truth,A) = A.
% 0.72/1.11 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.72/1.11 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Passive:
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 UNIT CONFLICT from 236 and 5 at 0.02 seconds.
% 0.72/1.11
% 0.72/1.11 ---------------- PROOF ----------------
% 0.72/1.11 % SZS output start Refutation
% See solution above
% 0.72/1.11 ------------ end of proof -------------
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 ------------- memory usage ------------
% 0.72/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.72/1.11 type (bytes each) gets frees in use avail bytes
% 0.72/1.11 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.72/1.11 term ( 16) 29016 24446 4570 20 88.7 K
% 0.72/1.11 gen_ptr ( 8) 26502 5773 20729 32 162.2 K
% 0.72/1.11 context ( 808) 20511 20509 2 2 3.2 K
% 0.72/1.11 trail ( 12) 2806 2806 0 6 0.1 K
% 0.72/1.11 bt_node ( 68) 8078 8075 3 14 1.1 K
% 0.72/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.11 ac_match_free_vars_pos (4020)
% 0.72/1.11 0 0 0 0 0.0 K
% 0.72/1.11 discrim ( 12) 4859 292 4567 0 53.5 K
% 0.72/1.11 flat ( 40) 53109 53109 0 37 1.4 K
% 0.72/1.11 discrim_pos ( 12) 1692 1692 0 1 0.0 K
% 0.72/1.11 fpa_head ( 12) 797 0 797 0 9.3 K
% 0.72/1.11 fpa_tree ( 28) 1364 1364 0 21 0.6 K
% 0.72/1.11 fpa_pos ( 36) 453 453 0 1 0.0 K
% 0.72/1.11 literal ( 12) 1267 1031 236 1 2.8 K
% 0.72/1.11 clause ( 24) 1267 1031 236 1 5.6 K
% 0.72/1.11 list ( 12) 276 220 56 3 0.7 K
% 0.72/1.11 list_pos ( 20) 973 120 853 0 16.7 K
% 0.72/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.11
% 0.72/1.11 -------------- statistics -------------
% 0.72/1.11 Clauses input 5
% 0.72/1.11 Usable input 0
% 0.72/1.11 Sos input 5
% 0.72/1.11 Demodulators input 0
% 0.72/1.11 Passive input 0
% 0.72/1.11
% 0.72/1.11 Processed BS (before search) 6
% 0.72/1.11 Forward subsumed BS 1
% 0.72/1.11 Kept BS 5
% 0.72/1.11 New demodulators BS 3
% 0.72/1.11 Back demodulated BS 0
% 0.72/1.11
% 0.72/1.11 Clauses or pairs given 562
% 0.72/1.11 Clauses generated 1009
% 0.72/1.11 Forward subsumed 778
% 0.72/1.11 Deleted by weight 0
% 0.72/1.11 Deleted by variable count 0
% 0.72/1.11 Kept 231
% 0.72/1.11 New demodulators 214
% 0.72/1.11 Back demodulated 23
% 0.72/1.11 Ordered paramod prunes 0
% 0.72/1.11 Basic paramod prunes 916
% 0.72/1.11 Prime paramod prunes 96
% 0.72/1.11 Semantic prunes 0
% 0.72/1.11
% 0.72/1.11 Rewrite attmepts 10569
% 0.72/1.11 Rewrites 1579
% 0.72/1.11
% 0.72/1.11 FPA overloads 0
% 0.72/1.11 FPA underloads 0
% 0.72/1.11
% 0.72/1.11 Usable size 0
% 0.72/1.11 Sos size 212
% 0.72/1.11 Demodulators size 194
% 0.72/1.11 Passive size 0
% 0.72/1.11 Disabled size 23
% 0.72/1.11
% 0.72/1.11 Proofs found 1
% 0.72/1.11
% 0.72/1.11 ----------- times (seconds) ----------- Sun Jul 3 14:06:34 2022
% 0.72/1.11
% 0.72/1.11 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.72/1.11 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.72/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.72/1.11 input time 0.00
% 0.72/1.11 paramodulation time 0.01
% 0.72/1.11 demodulation time 0.00
% 0.72/1.11 orient time 0.00
% 0.72/1.11 weigh time 0.00
% 0.72/1.11 forward subsume time 0.00
% 0.72/1.11 back demod find time 0.00
% 0.72/1.11 conflict time 0.00
% 0.72/1.11 LRPO time 0.00
% 0.72/1.11 store clause time 0.00
% 0.72/1.11 disable clause time 0.00
% 0.72/1.11 prime paramod time 0.00
% 0.72/1.11 semantics time 0.00
% 0.72/1.11
% 0.72/1.11 EQP interrupted
%------------------------------------------------------------------------------