TSTP Solution File: LCL116-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL116-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n019.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:08 EDT 2022
% Result : Unsatisfiable 0.91s 1.30s
% Output : Refutation 0.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 5
% Syntax : Number of clauses : 39 ( 39 unt; 0 nHn; 5 RR)
% Number of literals : 39 ( 0 equ; 2 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 : 55 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(implies(truth,A),A),
file('LCL116-2.p',unknown),
[] ).
cnf(2,plain,
equal(implies(implies(A,B),implies(implies(B,C),implies(A,C))),truth),
file('LCL116-2.p',unknown),
[] ).
cnf(3,plain,
equal(implies(implies(A,B),B),implies(implies(B,A),A)),
file('LCL116-2.p',unknown),
[] ).
cnf(4,plain,
equal(implies(implies(not(A),not(B)),implies(B,A)),truth),
file('LCL116-2.p',unknown),
[] ).
cnf(5,plain,
~ equal(implies(not(a),implies(b,not(implies(b,a)))),truth),
file('LCL116-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(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(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(180,plain,
equal(implies(not(A),not(B)),implies(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[25]),177,1]),
[iquote('back_demod(25),demod([177,1])')] ).
cnf(181,plain,
equal(implies(A,B),implies(not(B),not(A))),
inference(flip,[status(thm),theory(equality)],[180]),
[iquote('flip(180)')] ).
cnf(275,plain,
equal(implies(not(A),implies(implies(B,A),not(B))),truth),
inference(para,[status(thm),theory(equality)],[180,8]),
[iquote('para(180,8)')] ).
cnf(846,plain,
equal(implies(implies(not(A),not(B)),not(B)),implies(implies(A,B),not(A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[180,3]),1]),
[iquote('para(180,3),flip(1)')] ).
cnf(881,plain,
equal(implies(not(A),not(implies(B,A))),implies(implies(A,B),B)),
inference(para,[status(thm),theory(equality)],[181,3]),
[iquote('para(181,3)')] ).
cnf(889,plain,
equal(implies(A,not(implies(B,not(A)))),implies(implies(not(A),B),B)),
inference(para,[status(thm),theory(equality)],[161,881]),
[iquote('para(161,881)')] ).
cnf(904,plain,
~ equal(truth,truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[181,5]),889,846,275]),
[iquote('para(181,5),demod([889,846,275])')] ).
cnf(905,plain,
$false,
inference(conflict,[status(thm)],[904]),
[iquote('xx_conflict(904)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL116-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n019.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 04:31:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.91/1.30 ----- EQP 0.9e, May 2009 -----
% 0.91/1.30 The job began on n019.cluster.edu, Mon Jul 4 04:31:09 2022
% 0.91/1.30 The command was "./eqp09e".
% 0.91/1.30
% 0.91/1.30 set(prolog_style_variables).
% 0.91/1.30 set(lrpo).
% 0.91/1.30 set(basic_paramod).
% 0.91/1.30 set(functional_subsume).
% 0.91/1.30 set(ordered_paramod).
% 0.91/1.30 set(prime_paramod).
% 0.91/1.30 set(para_pairs).
% 0.91/1.30 assign(pick_given_ratio,4).
% 0.91/1.30 clear(print_kept).
% 0.91/1.30 clear(print_new_demod).
% 0.91/1.30 clear(print_back_demod).
% 0.91/1.30 clear(print_given).
% 0.91/1.30 assign(max_mem,64000).
% 0.91/1.30 end_of_commands.
% 0.91/1.30
% 0.91/1.30 Usable:
% 0.91/1.30 end_of_list.
% 0.91/1.30
% 0.91/1.30 Sos:
% 0.91/1.30 0 (wt=-1) [] implies(truth,A) = A.
% 0.91/1.30 0 (wt=-1) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.91/1.30 0 (wt=-1) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.91/1.30 0 (wt=-1) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.91/1.30 0 (wt=-1) [] -(implies(not(a),implies(b,not(implies(b,a)))) = truth).
% 0.91/1.30 end_of_list.
% 0.91/1.30
% 0.91/1.30 Demodulators:
% 0.91/1.30 end_of_list.
% 0.91/1.30
% 0.91/1.30 Passive:
% 0.91/1.30 end_of_list.
% 0.91/1.30
% 0.91/1.30 Starting to process input.
% 0.91/1.30
% 0.91/1.30 ** KEPT: 1 (wt=5) [] implies(truth,A) = A.
% 0.91/1.30 1 is a new demodulator.
% 0.91/1.30
% 0.91/1.30 ** KEPT: 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.91/1.30 2 is a new demodulator.
% 0.91/1.30
% 0.91/1.30 ** KEPT: 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.91/1.30 clause forward subsumed: 0 (wt=11) [flip(3)] implies(implies(B,A),A) = implies(implies(A,B),B).
% 0.91/1.30
% 0.91/1.30 ** KEPT: 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.91/1.30 4 is a new demodulator.
% 0.91/1.30
% 0.91/1.30 ** KEPT: 5 (wt=11) [] -(implies(not(a),implies(b,not(implies(b,a)))) = truth).
% 0.91/1.30 ---------------- PROOF FOUND ----------------
% 0.91/1.30 % SZS status Unsatisfiable
% 0.91/1.30
% 0.91/1.30
% 0.91/1.30 After processing input:
% 0.91/1.30
% 0.91/1.30 Usable:
% 0.91/1.30 end_of_list.
% 0.91/1.30
% 0.91/1.30 Sos:
% 0.91/1.30 1 (wt=5) [] implies(truth,A) = A.
% 0.91/1.30 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.91/1.30 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.91/1.30 5 (wt=11) [] -(implies(not(a),implies(b,not(implies(b,a)))) = truth).
% 0.91/1.30 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.91/1.30 end_of_list.
% 0.91/1.30
% 0.91/1.30 Demodulators:
% 0.91/1.30 1 (wt=5) [] implies(truth,A) = A.
% 0.91/1.30 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.91/1.30 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.91/1.30 end_of_list.
% 0.91/1.30
% 0.91/1.30 Passive:
% 0.91/1.30 end_of_list.
% 0.91/1.30
% 0.91/1.30 UNIT CONFLICT from 904 and x=x at 0.12 seconds.
% 0.91/1.30
% 0.91/1.30 ---------------- PROOF ----------------
% 0.91/1.30 % SZS output start Refutation
% See solution above
% 0.91/1.30 ------------ end of proof -------------
% 0.91/1.30
% 0.91/1.30
% 0.91/1.30 ------------- memory usage ------------
% 0.91/1.30 Memory dynamically allocated (tp_alloc): 1953.
% 0.91/1.30 type (bytes each) gets frees in use avail bytes
% 0.91/1.30 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.91/1.30 term ( 16) 154658 133199 21459 56 416.7 K
% 0.91/1.30 gen_ptr ( 8) 138871 31416 107455 38 839.8 K
% 0.91/1.30 context ( 808) 103961 103959 2 3 3.9 K
% 0.91/1.30 trail ( 12) 13218 13218 0 8 0.1 K
% 0.91/1.30 bt_node ( 68) 38559 38556 3 22 1.7 K
% 0.91/1.30 ac_position (285432) 0 0 0 0 0.0 K
% 0.91/1.30 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.91/1.30 ac_match_free_vars_pos (4020)
% 0.91/1.30 0 0 0 0 0.0 K
% 0.91/1.30 discrim ( 12) 22416 3548 18868 1238 235.6 K
% 0.91/1.30 flat ( 40) 336144 336144 0 47 1.8 K
% 0.91/1.30 discrim_pos ( 12) 8480 8480 0 1 0.0 K
% 0.91/1.30 fpa_head ( 12) 2030 0 2030 0 23.8 K
% 0.91/1.30 fpa_tree ( 28) 5828 5828 0 25 0.7 K
% 0.91/1.30 fpa_pos ( 36) 1780 1780 0 1 0.0 K
% 0.91/1.30 literal ( 12) 5534 4630 904 0 10.6 K
% 0.91/1.30 clause ( 24) 5534 4630 904 0 21.2 K
% 0.91/1.30 list ( 12) 936 880 56 3 0.7 K
% 0.91/1.30 list_pos ( 20) 3853 660 3193 99 64.3 K
% 0.91/1.30 pair_index ( 40) 2 0 2 0 0.1 K
% 0.91/1.30
% 0.91/1.30 -------------- statistics -------------
% 0.91/1.30 Clauses input 5
% 0.91/1.30 Usable input 0
% 0.91/1.30 Sos input 5
% 0.91/1.30 Demodulators input 0
% 0.91/1.30 Passive input 0
% 0.91/1.30
% 0.91/1.30 Processed BS (before search) 6
% 0.91/1.30 Forward subsumed BS 1
% 0.91/1.30 Kept BS 5
% 0.91/1.30 New demodulators BS 3
% 0.91/1.30 Back demodulated BS 0
% 0.91/1.30
% 0.91/1.30 Clauses or pairs given 2332
% 0.91/1.30 Clauses generated 4571
% 0.91/1.30 Forward subsumed 3672
% 0.91/1.30 Deleted by weight 0
% 0.91/1.30 Deleted by variable count 0
% 0.91/1.30 Kept 899
% 0.91/1.30 New demodulators 874
% 0.91/1.30 Back demodulated 131
% 0.91/1.30 Ordered paramod prunes 0
% 0.91/1.30 Basic paramod prunes 4355
% 0.91/1.30 Prime paramod prunes 435
% 0.91/1.30 Semantic prunes 0
% 0.91/1.30
% 0.91/1.30 Rewrite attmepts 55747
% 0.91/1.30 Rewrites 7993
% 0.91/1.30
% 0.91/1.30 FPA overloads 0
% 0.91/1.30 FPA underloads 0
% 0.91/1.30
% 0.91/1.30 Usable size 0
% 0.91/1.30 Sos size 772
% 0.91/1.30 Demodulators size 746
% 0.91/1.30 Passive size 0
% 0.91/1.30 Disabled size 131
% 0.91/1.30
% 0.91/1.30 Proofs found 1
% 0.91/1.30
% 0.91/1.30 ----------- times (seconds) ----------- Mon Jul 4 04:31:09 2022
% 0.91/1.30
% 0.91/1.30 user CPU time 0.12 (0 hr, 0 min, 0 sec)
% 0.91/1.30 system CPU time 0.10 (0 hr, 0 min, 0 sec)
% 0.91/1.30 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.91/1.30 input time 0.00
% 0.91/1.30 paramodulation time 0.04
% 0.91/1.30 demodulation time 0.02
% 0.91/1.30 orient time 0.01
% 0.91/1.30 weigh time 0.01
% 0.91/1.30 forward subsume time 0.01
% 0.91/1.30 back demod find time 0.00
% 0.91/1.30 conflict time 0.00
% 0.91/1.30 LRPO time 0.01
% 0.91/1.30 store clause time 0.01
% 0.91/1.30 disable clause time 0.00
% 0.91/1.30 prime paramod time 0.01
% 0.91/1.30 semantics time 0.00
% 0.91/1.30
% 0.91/1.30 EQP interrupted
%------------------------------------------------------------------------------