TSTP Solution File: LCL112-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL112-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n023.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:05 EDT 2022
% Result : Unsatisfiable 0.67s 1.11s
% Output : Refutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of clauses : 28 ( 28 unt; 0 nHn; 5 RR)
% Number of literals : 28 ( 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(implies(truth,A),A),
file('LCL112-2.p',unknown),
[] ).
cnf(2,plain,
equal(implies(implies(A,B),implies(implies(B,C),implies(A,C))),truth),
file('LCL112-2.p',unknown),
[] ).
cnf(3,plain,
equal(implies(implies(A,B),B),implies(implies(B,A),A)),
file('LCL112-2.p',unknown),
[] ).
cnf(4,plain,
equal(implies(implies(not(A),not(B)),implies(B,A)),truth),
file('LCL112-2.p',unknown),
[] ).
cnf(5,plain,
~ equal(implies(x,not(not(x))),truth),
file('LCL112-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(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(166,plain,
equal(not(not(A)),A),
inference(para,[status(thm),theory(equality)],[160,158]),
[iquote('para(160,158)')] ).
cnf(167,plain,
~ equal(truth,truth),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[5]),166,9]),
[iquote('back_demod(5),demod([166,9])')] ).
cnf(168,plain,
$false,
inference(conflict,[status(thm)],[167]),
[iquote('xx_conflict(167)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL112-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n023.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 09:49:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.67/1.11 ----- EQP 0.9e, May 2009 -----
% 0.67/1.11 The job began on n023.cluster.edu, Sun Jul 3 09:49:14 2022
% 0.67/1.11 The command was "./eqp09e".
% 0.67/1.11
% 0.67/1.11 set(prolog_style_variables).
% 0.67/1.11 set(lrpo).
% 0.67/1.11 set(basic_paramod).
% 0.67/1.11 set(functional_subsume).
% 0.67/1.11 set(ordered_paramod).
% 0.67/1.11 set(prime_paramod).
% 0.67/1.11 set(para_pairs).
% 0.67/1.11 assign(pick_given_ratio,4).
% 0.67/1.11 clear(print_kept).
% 0.67/1.11 clear(print_new_demod).
% 0.67/1.11 clear(print_back_demod).
% 0.67/1.11 clear(print_given).
% 0.67/1.11 assign(max_mem,64000).
% 0.67/1.11 end_of_commands.
% 0.67/1.11
% 0.67/1.11 Usable:
% 0.67/1.11 end_of_list.
% 0.67/1.11
% 0.67/1.11 Sos:
% 0.67/1.11 0 (wt=-1) [] implies(truth,A) = A.
% 0.67/1.11 0 (wt=-1) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.67/1.11 0 (wt=-1) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.67/1.11 0 (wt=-1) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.67/1.11 0 (wt=-1) [] -(implies(x,not(not(x))) = truth).
% 0.67/1.11 end_of_list.
% 0.67/1.11
% 0.67/1.11 Demodulators:
% 0.67/1.11 end_of_list.
% 0.67/1.11
% 0.67/1.11 Passive:
% 0.67/1.11 end_of_list.
% 0.67/1.11
% 0.67/1.11 Starting to process input.
% 0.67/1.11
% 0.67/1.11 ** KEPT: 1 (wt=5) [] implies(truth,A) = A.
% 0.67/1.11 1 is a new demodulator.
% 0.67/1.11
% 0.67/1.11 ** KEPT: 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.67/1.11 2 is a new demodulator.
% 0.67/1.11
% 0.67/1.11 ** KEPT: 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.67/1.11 clause forward subsumed: 0 (wt=11) [flip(3)] implies(implies(B,A),A) = implies(implies(A,B),B).
% 0.67/1.11
% 0.67/1.11 ** KEPT: 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.67/1.11 4 is a new demodulator.
% 0.67/1.11
% 0.67/1.11 ** KEPT: 5 (wt=7) [] -(implies(x,not(not(x))) = truth).
% 0.67/1.11 ---------------- PROOF FOUND ----------------
% 0.67/1.11 % SZS status Unsatisfiable
% 0.67/1.11
% 0.67/1.11
% 0.67/1.11 After processing input:
% 0.67/1.11
% 0.67/1.11 Usable:
% 0.67/1.11 end_of_list.
% 0.67/1.11
% 0.67/1.11 Sos:
% 0.67/1.11 1 (wt=5) [] implies(truth,A) = A.
% 0.67/1.11 5 (wt=7) [] -(implies(x,not(not(x))) = truth).
% 0.67/1.11 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.67/1.11 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.67/1.11 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.67/1.11 end_of_list.
% 0.67/1.11
% 0.67/1.11 Demodulators:
% 0.67/1.11 1 (wt=5) [] implies(truth,A) = A.
% 0.67/1.11 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.67/1.11 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.67/1.11 end_of_list.
% 0.67/1.11
% 0.67/1.11 Passive:
% 0.67/1.11 end_of_list.
% 0.67/1.11
% 0.67/1.11 UNIT CONFLICT from 167 and x=x at 0.02 seconds.
% 0.67/1.11
% 0.67/1.11 ---------------- PROOF ----------------
% 0.67/1.11 % SZS output start Refutation
% See solution above
% 0.67/1.11 ------------ end of proof -------------
% 0.67/1.11
% 0.67/1.11
% 0.67/1.11 ------------- memory usage ------------
% 0.67/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.67/1.11 type (bytes each) gets frees in use avail bytes
% 0.67/1.11 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.67/1.11 term ( 16) 23284 19910 3374 18 65.6 K
% 0.67/1.11 gen_ptr ( 8) 20241 4641 15600 27 122.1 K
% 0.67/1.11 context ( 808) 16174 16172 2 2 3.2 K
% 0.67/1.11 trail ( 12) 2006 2006 0 6 0.1 K
% 0.67/1.11 bt_node ( 68) 6383 6379 4 13 1.1 K
% 0.67/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.67/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.67/1.11 ac_match_free_vars_pos (4020)
% 0.67/1.11 0 0 0 0 0.0 K
% 0.67/1.11 discrim ( 12) 3818 151 3667 17 43.2 K
% 0.67/1.11 flat ( 40) 41952 41952 0 37 1.4 K
% 0.67/1.11 discrim_pos ( 12) 1396 1396 0 1 0.0 K
% 0.67/1.11 fpa_head ( 12) 649 0 649 0 7.6 K
% 0.67/1.11 fpa_tree ( 28) 967 967 0 17 0.5 K
% 0.67/1.11 fpa_pos ( 36) 328 328 0 1 0.0 K
% 0.67/1.11 literal ( 12) 973 806 167 0 2.0 K
% 0.67/1.11 clause ( 24) 973 806 167 0 3.9 K
% 0.67/1.11 list ( 12) 221 164 57 2 0.7 K
% 0.67/1.11 list_pos ( 20) 697 84 613 11 12.2 K
% 0.67/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.67/1.11
% 0.67/1.11 -------------- statistics -------------
% 0.67/1.11 Clauses input 5
% 0.67/1.11 Usable input 0
% 0.67/1.11 Sos input 5
% 0.67/1.11 Demodulators input 0
% 0.67/1.11 Passive input 0
% 0.67/1.11
% 0.67/1.11 Processed BS (before search) 6
% 0.67/1.11 Forward subsumed BS 1
% 0.67/1.11 Kept BS 5
% 0.67/1.11 New demodulators BS 3
% 0.67/1.11 Back demodulated BS 0
% 0.67/1.11
% 0.67/1.11 Clauses or pairs given 421
% 0.67/1.11 Clauses generated 797
% 0.67/1.11 Forward subsumed 635
% 0.67/1.11 Deleted by weight 0
% 0.67/1.11 Deleted by variable count 0
% 0.67/1.11 Kept 162
% 0.67/1.11 New demodulators 159
% 0.67/1.11 Back demodulated 16
% 0.67/1.11 Ordered paramod prunes 0
% 0.67/1.11 Basic paramod prunes 674
% 0.67/1.11 Prime paramod prunes 78
% 0.67/1.11 Semantic prunes 0
% 0.67/1.11
% 0.67/1.11 Rewrite attmepts 8449
% 0.67/1.11 Rewrites 1315
% 0.67/1.11
% 0.67/1.11 FPA overloads 0
% 0.67/1.11 FPA underloads 0
% 0.67/1.11
% 0.67/1.11 Usable size 0
% 0.67/1.11 Sos size 150
% 0.67/1.11 Demodulators size 147
% 0.67/1.11 Passive size 0
% 0.67/1.11 Disabled size 16
% 0.67/1.11
% 0.67/1.11 Proofs found 1
% 0.67/1.11
% 0.67/1.11 ----------- times (seconds) ----------- Sun Jul 3 09:49:14 2022
% 0.67/1.11
% 0.67/1.11 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.67/1.11 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.67/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.67/1.11 input time 0.00
% 0.67/1.11 paramodulation time 0.00
% 0.67/1.11 demodulation time 0.00
% 0.67/1.11 orient time 0.00
% 0.67/1.11 weigh time 0.00
% 0.67/1.11 forward subsume time 0.00
% 0.67/1.11 back demod find time 0.00
% 0.67/1.11 conflict time 0.00
% 0.67/1.11 LRPO time 0.00
% 0.67/1.11 store clause time 0.00
% 0.67/1.11 disable clause time 0.00
% 0.67/1.11 prime paramod time 0.00
% 0.67/1.11 semantics time 0.00
% 0.67/1.11
% 0.67/1.11 EQP interrupted
%------------------------------------------------------------------------------