TSTP Solution File: LCL134-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL134-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n009.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.41s 1.07s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 2 RR)
% Number of literals : 10 ( 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 12 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(implies(truth,A),A),
file('LCL134-1.p',unknown),
[] ).
cnf(2,plain,
equal(implies(implies(A,B),implies(implies(B,C),implies(A,C))),truth),
file('LCL134-1.p',unknown),
[] ).
cnf(3,plain,
equal(implies(implies(A,B),B),implies(implies(B,A),A)),
file('LCL134-1.p',unknown),
[] ).
cnf(5,plain,
~ equal(implies(x,truth),truth),
file('LCL134-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(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(21,plain,
equal(implies(A,truth),truth),
inference(para,[status(thm),theory(equality)],[10,7]),
[iquote('para(10,7)')] ).
cnf(22,plain,
$false,
inference(conflict,[status(thm)],[21,5]),
[iquote('conflict(21,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL134-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n009.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 04:26:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.07 ----- EQP 0.9e, May 2009 -----
% 0.41/1.07 The job began on n009.cluster.edu, Sun Jul 3 04:26:08 2022
% 0.41/1.07 The command was "./eqp09e".
% 0.41/1.07
% 0.41/1.07 set(prolog_style_variables).
% 0.41/1.07 set(lrpo).
% 0.41/1.07 set(basic_paramod).
% 0.41/1.07 set(functional_subsume).
% 0.41/1.07 set(ordered_paramod).
% 0.41/1.07 set(prime_paramod).
% 0.41/1.07 set(para_pairs).
% 0.41/1.07 assign(pick_given_ratio,4).
% 0.41/1.07 clear(print_kept).
% 0.41/1.07 clear(print_new_demod).
% 0.41/1.07 clear(print_back_demod).
% 0.41/1.07 clear(print_given).
% 0.41/1.07 assign(max_mem,64000).
% 0.41/1.07 end_of_commands.
% 0.41/1.07
% 0.41/1.07 Usable:
% 0.41/1.07 end_of_list.
% 0.41/1.07
% 0.41/1.07 Sos:
% 0.41/1.07 0 (wt=-1) [] implies(truth,A) = A.
% 0.41/1.07 0 (wt=-1) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.41/1.07 0 (wt=-1) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.41/1.07 0 (wt=-1) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.41/1.07 0 (wt=-1) [] -(implies(x,truth) = truth).
% 0.41/1.07 end_of_list.
% 0.41/1.07
% 0.41/1.07 Demodulators:
% 0.41/1.07 end_of_list.
% 0.41/1.07
% 0.41/1.07 Passive:
% 0.41/1.07 end_of_list.
% 0.41/1.07
% 0.41/1.07 Starting to process input.
% 0.41/1.07
% 0.41/1.07 ** KEPT: 1 (wt=5) [] implies(truth,A) = A.
% 0.41/1.07 1 is a new demodulator.
% 0.41/1.07
% 0.41/1.07 ** KEPT: 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.41/1.07 2 is a new demodulator.
% 0.41/1.07
% 0.41/1.07 ** KEPT: 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.41/1.07 clause forward subsumed: 0 (wt=11) [flip(3)] implies(implies(B,A),A) = implies(implies(A,B),B).
% 0.41/1.07
% 0.41/1.07 ** KEPT: 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.41/1.07 4 is a new demodulator.
% 0.41/1.07
% 0.41/1.07 ** KEPT: 5 (wt=5) [] -(implies(x,truth) = truth).
% 0.41/1.07 ---------------- PROOF FOUND ----------------
% 0.41/1.07 % SZS status Unsatisfiable
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 After processing input:
% 0.41/1.07
% 0.41/1.07 Usable:
% 0.41/1.07 end_of_list.
% 0.41/1.07
% 0.41/1.07 Sos:
% 0.41/1.07 1 (wt=5) [] implies(truth,A) = A.
% 0.41/1.07 5 (wt=5) [] -(implies(x,truth) = truth).
% 0.41/1.07 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.41/1.07 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.41/1.07 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.41/1.07 end_of_list.
% 0.41/1.07
% 0.41/1.07 Demodulators:
% 0.41/1.07 1 (wt=5) [] implies(truth,A) = A.
% 0.41/1.07 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.41/1.07 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.41/1.07 end_of_list.
% 0.41/1.07
% 0.41/1.07 Passive:
% 0.41/1.07 end_of_list.
% 0.41/1.07
% 0.41/1.07 UNIT CONFLICT from 21 and 5 at 0.00 seconds.
% 0.41/1.07
% 0.41/1.07 ---------------- PROOF ----------------
% 0.41/1.07 % SZS output start Refutation
% See solution above
% 0.41/1.07 ------------ end of proof -------------
% 0.41/1.07
% 0.41/1.07
% 0.41/1.07 ------------- memory usage ------------
% 0.41/1.07 Memory dynamically allocated (tp_alloc): 488.
% 0.41/1.07 type (bytes each) gets frees in use avail bytes
% 0.41/1.07 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.41/1.07 term ( 16) 1209 946 263 23 5.5 K
% 0.41/1.07 gen_ptr ( 8) 1161 203 958 9 7.6 K
% 0.41/1.07 context ( 808) 580 578 2 2 3.2 K
% 0.41/1.07 trail ( 12) 93 93 0 4 0.0 K
% 0.41/1.07 bt_node ( 68) 192 187 5 6 0.7 K
% 0.41/1.07 ac_position (285432) 0 0 0 0 0.0 K
% 0.41/1.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.41/1.07 ac_match_free_vars_pos (4020)
% 0.41/1.07 0 0 0 0 0.0 K
% 0.41/1.07 discrim ( 12) 279 12 267 0 3.1 K
% 0.41/1.07 flat ( 40) 1351 1351 0 21 0.8 K
% 0.41/1.07 discrim_pos ( 12) 28 28 0 1 0.0 K
% 0.41/1.07 fpa_head ( 12) 137 0 137 0 1.6 K
% 0.41/1.07 fpa_tree ( 28) 76 76 0 7 0.2 K
% 0.41/1.07 fpa_pos ( 36) 39 39 0 1 0.0 K
% 0.41/1.07 literal ( 12) 62 41 21 1 0.3 K
% 0.41/1.08 clause ( 24) 62 41 21 1 0.5 K
% 0.41/1.08 list ( 12) 77 21 56 3 0.7 K
% 0.41/1.08 list_pos ( 20) 87 15 72 0 1.4 K
% 0.41/1.08 pair_index ( 40) 2 0 2 0 0.1 K
% 0.41/1.08
% 0.41/1.08 -------------- statistics -------------
% 0.41/1.08 Clauses input 5
% 0.41/1.08 Usable input 0
% 0.41/1.08 Sos input 5
% 0.41/1.08 Demodulators input 0
% 0.41/1.08 Passive input 0
% 0.41/1.08
% 0.41/1.08 Processed BS (before search) 6
% 0.41/1.08 Forward subsumed BS 1
% 0.41/1.08 Kept BS 5
% 0.41/1.08 New demodulators BS 3
% 0.41/1.08 Back demodulated BS 0
% 0.41/1.08
% 0.41/1.08 Clauses or pairs given 21
% 0.41/1.08 Clauses generated 35
% 0.41/1.08 Forward subsumed 19
% 0.41/1.08 Deleted by weight 0
% 0.41/1.08 Deleted by variable count 0
% 0.41/1.08 Kept 16
% 0.41/1.08 New demodulators 15
% 0.41/1.08 Back demodulated 2
% 0.41/1.08 Ordered paramod prunes 0
% 0.41/1.08 Basic paramod prunes 12
% 0.41/1.08 Prime paramod prunes 1
% 0.41/1.08 Semantic prunes 0
% 0.41/1.08
% 0.41/1.08 Rewrite attmepts 297
% 0.41/1.08 Rewrites 26
% 0.41/1.08
% 0.41/1.08 FPA overloads 0
% 0.41/1.08 FPA underloads 0
% 0.41/1.08
% 0.41/1.08 Usable size 0
% 0.41/1.08 Sos size 18
% 0.41/1.08 Demodulators size 16
% 0.41/1.08 Passive size 0
% 0.41/1.08 Disabled size 2
% 0.41/1.08
% 0.41/1.08 Proofs found 1
% 0.41/1.08
% 0.41/1.08 ----------- times (seconds) ----------- Sun Jul 3 04:26:08 2022
% 0.41/1.08
% 0.41/1.08 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.41/1.08 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.41/1.08 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.41/1.08 input time 0.00
% 0.41/1.08 paramodulation time 0.00
% 0.41/1.08 demodulation time 0.00
% 0.41/1.08 orient time 0.00
% 0.41/1.08 weigh time 0.00
% 0.41/1.08 forward subsume time 0.00
% 0.41/1.08 back demod find time 0.00
% 0.41/1.08 conflict time 0.00
% 0.41/1.08 LRPO time 0.00
% 0.41/1.08 store clause time 0.00
% 0.41/1.08 disable clause time 0.00
% 0.41/1.08 prime paramod time 0.00
% 0.41/1.08 semantics time 0.00
% 0.41/1.08
% 0.41/1.08 EQP interrupted
%------------------------------------------------------------------------------