TSTP Solution File: LCL114-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL114-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n029.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.75s 1.14s
% Output : Refutation 0.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 4 RR)
% Number of literals : 31 ( 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 : 41 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(implies(truth,A),A),
file('LCL114-2.p',unknown),
[] ).
cnf(2,plain,
equal(implies(implies(A,B),implies(implies(B,C),implies(A,C))),truth),
file('LCL114-2.p',unknown),
[] ).
cnf(3,plain,
equal(implies(implies(A,B),B),implies(implies(B,A),A)),
file('LCL114-2.p',unknown),
[] ).
cnf(4,plain,
equal(implies(implies(not(A),not(B)),implies(B,A)),truth),
file('LCL114-2.p',unknown),
[] ).
cnf(5,plain,
~ equal(implies(implies(x,y),implies(not(y),not(x))),truth),
file('LCL114-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(175,plain,
equal(implies(implies(A,not(B)),implies(B,not(A))),truth),
inference(para,[status(thm),theory(equality)],[161,4]),
[iquote('para(161,4)')] ).
cnf(177,plain,
equal(implies(implies(A,B),implies(not(B),not(A))),truth),
inference(para,[status(thm),theory(equality)],[161,175]),
[iquote('para(161,175)')] ).
cnf(178,plain,
$false,
inference(conflict,[status(thm)],[177,5]),
[iquote('conflict(177,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL114-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jul 2 17:45:55 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.75/1.14 ----- EQP 0.9e, May 2009 -----
% 0.75/1.14 The job began on n029.cluster.edu, Sat Jul 2 17:45:56 2022
% 0.75/1.14 The command was "./eqp09e".
% 0.75/1.14
% 0.75/1.14 set(prolog_style_variables).
% 0.75/1.14 set(lrpo).
% 0.75/1.14 set(basic_paramod).
% 0.75/1.14 set(functional_subsume).
% 0.75/1.14 set(ordered_paramod).
% 0.75/1.14 set(prime_paramod).
% 0.75/1.14 set(para_pairs).
% 0.75/1.14 assign(pick_given_ratio,4).
% 0.75/1.14 clear(print_kept).
% 0.75/1.14 clear(print_new_demod).
% 0.75/1.14 clear(print_back_demod).
% 0.75/1.14 clear(print_given).
% 0.75/1.14 assign(max_mem,64000).
% 0.75/1.14 end_of_commands.
% 0.75/1.14
% 0.75/1.14 Usable:
% 0.75/1.14 end_of_list.
% 0.75/1.14
% 0.75/1.14 Sos:
% 0.75/1.14 0 (wt=-1) [] implies(truth,A) = A.
% 0.75/1.14 0 (wt=-1) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.75/1.14 0 (wt=-1) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.75/1.14 0 (wt=-1) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.75/1.14 0 (wt=-1) [] -(implies(implies(x,y),implies(not(y),not(x))) = truth).
% 0.75/1.14 end_of_list.
% 0.75/1.14
% 0.75/1.14 Demodulators:
% 0.75/1.14 end_of_list.
% 0.75/1.14
% 0.75/1.14 Passive:
% 0.75/1.14 end_of_list.
% 0.75/1.14
% 0.75/1.14 Starting to process input.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 1 (wt=5) [] implies(truth,A) = A.
% 0.75/1.14 1 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.75/1.14 2 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.75/1.14 clause forward subsumed: 0 (wt=11) [flip(3)] implies(implies(B,A),A) = implies(implies(A,B),B).
% 0.75/1.14
% 0.75/1.14 ** KEPT: 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.75/1.14 4 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 5 (wt=11) [] -(implies(implies(x,y),implies(not(y),not(x))) = truth).
% 0.75/1.14 ---------------- PROOF FOUND ----------------
% 0.75/1.14 % SZS status Unsatisfiable
% 0.75/1.14
% 0.75/1.14
% 0.75/1.14 After processing input:
% 0.75/1.14
% 0.75/1.14 Usable:
% 0.75/1.14 end_of_list.
% 0.75/1.14
% 0.75/1.14 Sos:
% 0.75/1.14 1 (wt=5) [] implies(truth,A) = A.
% 0.75/1.14 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.75/1.14 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.75/1.14 5 (wt=11) [] -(implies(implies(x,y),implies(not(y),not(x))) = truth).
% 0.75/1.14 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.75/1.14 end_of_list.
% 0.75/1.14
% 0.75/1.14 Demodulators:
% 0.75/1.14 1 (wt=5) [] implies(truth,A) = A.
% 0.75/1.14 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.75/1.14 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.75/1.14 end_of_list.
% 0.75/1.15
% 0.75/1.15 Passive:
% 0.75/1.15 end_of_list.
% 0.75/1.15
% 0.75/1.15 UNIT CONFLICT from 177 and 5 at 0.01 seconds.
% 0.75/1.15
% 0.75/1.15 ---------------- PROOF ----------------
% 0.75/1.15 % SZS output start Refutation
% See solution above
% 0.75/1.15 ------------ end of proof -------------
% 0.75/1.15
% 0.75/1.15
% 0.75/1.15 ------------- memory usage ------------
% 0.75/1.15 Memory dynamically allocated (tp_alloc): 488.
% 0.75/1.15 type (bytes each) gets frees in use avail bytes
% 0.75/1.15 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.75/1.15 term ( 16) 23952 20416 3536 24 68.8 K
% 0.75/1.15 gen_ptr ( 8) 21515 5258 16257 30 127.2 K
% 0.75/1.15 context ( 808) 17048 17046 2 2 3.2 K
% 0.75/1.15 trail ( 12) 1402 1402 0 6 0.1 K
% 0.75/1.15 bt_node ( 68) 6648 6646 2 15 1.1 K
% 0.75/1.15 ac_position (285432) 0 0 0 0 0.0 K
% 0.75/1.15 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.75/1.15 ac_match_free_vars_pos (4020)
% 0.75/1.15 0 0 0 0 0.0 K
% 0.75/1.15 discrim ( 12) 3991 381 3610 0 42.3 K
% 0.75/1.15 flat ( 40) 43201 43201 0 37 1.4 K
% 0.75/1.15 discrim_pos ( 12) 1462 1462 0 1 0.0 K
% 0.75/1.15 fpa_head ( 12) 676 0 676 0 7.9 K
% 0.75/1.15 fpa_tree ( 28) 1054 1054 0 17 0.5 K
% 0.75/1.15 fpa_pos ( 36) 349 349 0 1 0.0 K
% 0.75/1.15 literal ( 12) 1023 846 177 1 2.1 K
% 0.75/1.15 clause ( 24) 1023 846 177 1 4.2 K
% 0.75/1.15 list ( 12) 231 175 56 3 0.7 K
% 0.75/1.15 list_pos ( 20) 765 155 610 0 11.9 K
% 0.75/1.15 pair_index ( 40) 2 0 2 0 0.1 K
% 0.75/1.15
% 0.75/1.15 -------------- statistics -------------
% 0.75/1.15 Clauses input 5
% 0.75/1.15 Usable input 0
% 0.75/1.15 Sos input 5
% 0.75/1.15 Demodulators input 0
% 0.75/1.15 Passive input 0
% 0.75/1.15
% 0.75/1.15 Processed BS (before search) 6
% 0.75/1.15 Forward subsumed BS 1
% 0.75/1.15 Kept BS 5
% 0.75/1.15 New demodulators BS 3
% 0.75/1.15 Back demodulated BS 0
% 0.75/1.15
% 0.75/1.15 Clauses or pairs given 464
% 0.75/1.15 Clauses generated 833
% 0.75/1.15 Forward subsumed 661
% 0.75/1.15 Deleted by weight 0
% 0.75/1.15 Deleted by variable count 0
% 0.75/1.15 Kept 172
% 0.75/1.15 New demodulators 169
% 0.75/1.15 Back demodulated 30
% 0.75/1.15 Ordered paramod prunes 0
% 0.75/1.15 Basic paramod prunes 748
% 0.75/1.15 Prime paramod prunes 77
% 0.75/1.15 Semantic prunes 0
% 0.75/1.15
% 0.75/1.15 Rewrite attmepts 8868
% 0.75/1.15 Rewrites 1379
% 0.75/1.15
% 0.75/1.15 FPA overloads 0
% 0.75/1.15 FPA underloads 0
% 0.75/1.15
% 0.75/1.15 Usable size 0
% 0.75/1.15 Sos size 146
% 0.75/1.15 Demodulators size 142
% 0.75/1.15 Passive size 0
% 0.75/1.15 Disabled size 30
% 0.75/1.15
% 0.75/1.15 Proofs found 1
% 0.75/1.15
% 0.75/1.15 ----------- times (seconds) ----------- Sat Jul 2 17:45:56 2022
% 0.75/1.15
% 0.75/1.15 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.75/1.15 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.75/1.15 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.75/1.15 input time 0.00
% 0.75/1.15 paramodulation time 0.00
% 0.75/1.15 demodulation time 0.00
% 0.75/1.15 orient time 0.00
% 0.75/1.15 weigh time 0.00
% 0.75/1.15 forward subsume time 0.00
% 0.75/1.15 back demod find time 0.00
% 0.75/1.15 conflict time 0.00
% 0.75/1.15 LRPO time 0.00
% 0.75/1.15 store clause time 0.00
% 0.75/1.15 disable clause time 0.00
% 0.75/1.15 prime paramod time 0.00
% 0.75/1.15 semantics time 0.00
% 0.75/1.15
% 0.75/1.15 EQP interrupted
%------------------------------------------------------------------------------