TSTP Solution File: LCL135-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL135-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n008.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:14 EDT 2022
% Result : Unsatisfiable 0.43s 1.07s
% Output : Refutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 2 RR)
% Number of literals : 12 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(implies(truth,A),A),
file('LCL135-1.p',unknown),
[] ).
cnf(2,plain,
equal(implies(implies(A,B),implies(implies(B,C),implies(A,C))),truth),
file('LCL135-1.p',unknown),
[] ).
cnf(3,plain,
equal(implies(implies(A,B),B),implies(implies(B,A),A)),
file('LCL135-1.p',unknown),
[] ).
cnf(5,plain,
~ equal(implies(x,implies(y,x)),truth),
file('LCL135-1.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,
$false,
inference(conflict,[status(thm)],[20,5]),
[iquote('conflict(20,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL135-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n008.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 00:57:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/1.07 ----- EQP 0.9e, May 2009 -----
% 0.43/1.07 The job began on n008.cluster.edu, Sun Jul 3 00:57:54 2022
% 0.43/1.07 The command was "./eqp09e".
% 0.43/1.07
% 0.43/1.07 set(prolog_style_variables).
% 0.43/1.07 set(lrpo).
% 0.43/1.07 set(basic_paramod).
% 0.43/1.07 set(functional_subsume).
% 0.43/1.07 set(ordered_paramod).
% 0.43/1.07 set(prime_paramod).
% 0.43/1.07 set(para_pairs).
% 0.43/1.07 assign(pick_given_ratio,4).
% 0.43/1.07 clear(print_kept).
% 0.43/1.07 clear(print_new_demod).
% 0.43/1.07 clear(print_back_demod).
% 0.43/1.07 clear(print_given).
% 0.43/1.07 assign(max_mem,64000).
% 0.43/1.07 end_of_commands.
% 0.43/1.07
% 0.43/1.07 Usable:
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Sos:
% 0.43/1.07 0 (wt=-1) [] implies(truth,A) = A.
% 0.43/1.07 0 (wt=-1) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.43/1.07 0 (wt=-1) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.43/1.07 0 (wt=-1) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.43/1.07 0 (wt=-1) [] -(implies(x,implies(y,x)) = truth).
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Demodulators:
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Passive:
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Starting to process input.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 1 (wt=5) [] implies(truth,A) = A.
% 0.43/1.07 1 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.43/1.07 2 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.43/1.07 clause forward subsumed: 0 (wt=11) [flip(3)] implies(implies(B,A),A) = implies(implies(A,B),B).
% 0.43/1.07
% 0.43/1.07 ** KEPT: 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.43/1.07 4 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 5 (wt=7) [] -(implies(x,implies(y,x)) = truth).
% 0.43/1.07 ---------------- PROOF FOUND ----------------
% 0.43/1.07 % SZS status Unsatisfiable
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 After processing input:
% 0.43/1.07
% 0.43/1.07 Usable:
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Sos:
% 0.43/1.07 1 (wt=5) [] implies(truth,A) = A.
% 0.43/1.07 5 (wt=7) [] -(implies(x,implies(y,x)) = truth).
% 0.43/1.07 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.43/1.07 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.43/1.07 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Demodulators:
% 0.43/1.07 1 (wt=5) [] implies(truth,A) = A.
% 0.43/1.07 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.43/1.07 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Passive:
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 UNIT CONFLICT from 20 and 5 at 0.00 seconds.
% 0.43/1.07
% 0.43/1.07 ---------------- PROOF ----------------
% 0.43/1.07 % SZS output start Refutation
% See solution above
% 0.43/1.07 ------------ end of proof -------------
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 ------------- memory usage ------------
% 0.43/1.07 Memory dynamically allocated (tp_alloc): 488.
% 0.43/1.07 type (bytes each) gets frees in use avail bytes
% 0.43/1.07 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.43/1.07 term ( 16) 1211 969 242 15 4.9 K
% 0.43/1.07 gen_ptr ( 8) 1156 289 867 20 6.9 K
% 0.43/1.07 context ( 808) 581 579 2 2 3.2 K
% 0.43/1.07 trail ( 12) 77 77 0 4 0.0 K
% 0.43/1.07 bt_node ( 68) 192 187 5 6 0.7 K
% 0.43/1.07 ac_position (285432) 0 0 0 0 0.0 K
% 0.43/1.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.43/1.07 ac_match_free_vars_pos (4020)
% 0.43/1.07 0 0 0 0 0.0 K
% 0.43/1.07 discrim ( 12) 258 45 213 40 3.0 K
% 0.43/1.07 flat ( 40) 1273 1273 0 21 0.8 K
% 0.43/1.07 discrim_pos ( 12) 33 33 0 1 0.0 K
% 0.43/1.07 fpa_head ( 12) 141 0 141 0 1.7 K
% 0.43/1.07 fpa_tree ( 28) 71 71 0 7 0.2 K
% 0.43/1.07 fpa_pos ( 36) 37 37 0 1 0.0 K
% 0.43/1.07 literal ( 12) 61 41 20 1 0.2 K
% 0.43/1.07 clause ( 24) 61 41 20 1 0.5 K
% 0.43/1.07 list ( 12) 76 19 57 2 0.7 K
% 0.43/1.07 list_pos ( 20) 89 30 59 16 1.5 K
% 0.43/1.07 pair_index ( 40) 2 0 2 0 0.1 K
% 0.43/1.07
% 0.43/1.07 -------------- statistics -------------
% 0.43/1.07 Clauses input 5
% 0.43/1.07 Usable input 0
% 0.43/1.07 Sos input 5
% 0.43/1.07 Demodulators input 0
% 0.43/1.07 Passive input 0
% 0.43/1.07
% 0.43/1.07 Processed BS (before search) 6
% 0.43/1.07 Forward subsumed BS 1
% 0.43/1.07 Kept BS 5
% 0.43/1.07 New demodulators BS 3
% 0.43/1.07 Back demodulated BS 0
% 0.43/1.07
% 0.43/1.07 Clauses or pairs given 19
% 0.43/1.07 Clauses generated 35
% 0.43/1.07 Forward subsumed 20
% 0.43/1.07 Deleted by weight 0
% 0.43/1.07 Deleted by variable count 0
% 0.43/1.07 Kept 15
% 0.43/1.07 New demodulators 14
% 0.43/1.07 Back demodulated 5
% 0.43/1.07 Ordered paramod prunes 0
% 0.43/1.07 Basic paramod prunes 10
% 0.43/1.07 Prime paramod prunes 1
% 0.43/1.07 Semantic prunes 0
% 0.43/1.07
% 0.43/1.07 Rewrite attmepts 300
% 0.43/1.07 Rewrites 31
% 0.43/1.07
% 0.43/1.07 FPA overloads 0
% 0.43/1.07 FPA underloads 0
% 0.43/1.07
% 0.43/1.07 Usable size 0
% 0.43/1.07 Sos size 14
% 0.43/1.07 Demodulators size 12
% 0.43/1.07 Passive size 0
% 0.43/1.07 Disabled size 5
% 0.43/1.07
% 0.43/1.07 Proofs found 1
% 0.43/1.07
% 0.43/1.07 ----------- times (seconds) ----------- Sun Jul 3 00:57:54 2022
% 0.43/1.07
% 0.43/1.07 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.43/1.07 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.43/1.07 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.43/1.07 input time 0.00
% 0.43/1.07 paramodulation time 0.00
% 0.43/1.07 demodulation time 0.00
% 0.43/1.07 orient time 0.00
% 0.43/1.07 weigh time 0.00
% 0.43/1.07 forward subsume time 0.00
% 0.43/1.07 back demod find time 0.00
% 0.43/1.07 conflict time 0.00
% 0.43/1.07 LRPO time 0.00
% 0.43/1.07 store clause time 0.00
% 0.43/1.07 disable clause time 0.00
% 0.43/1.07 prime paramod time 0.00
% 0.43/1.07 semantics time 0.00
% 0.43/1.07
% 0.43/1.07 EQP interrupted
%------------------------------------------------------------------------------