TSTP Solution File: LCL133-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL133-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n007.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.42s 1.09s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 3 RR)
% Number of literals : 11 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 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 : 13 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(implies(truth,A),A),
file('LCL133-1.p',unknown),
[] ).
cnf(2,plain,
equal(implies(implies(A,B),implies(implies(B,C),implies(A,C))),truth),
file('LCL133-1.p',unknown),
[] ).
cnf(3,plain,
equal(implies(implies(A,B),B),implies(implies(B,A),A)),
file('LCL133-1.p',unknown),
[] ).
cnf(5,plain,
equal(implies(A,B),implies(B,A)),
file('LCL133-1.p',unknown),
[] ).
cnf(6,plain,
~ equal(y,x),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('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,truth),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,5]),1]),
[iquote('para(1,5),flip(1)')] ).
cnf(15,plain,
equal(implies(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,3]),9,9]),
[iquote('para(1,3),demod([9,9])')] ).
cnf(20,plain,
equal(A,truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,7]),15,1]),
[iquote('para(1,7),demod([15,1])')] ).
cnf(22,plain,
~ equal(x,truth),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,6]),1]),
[iquote('para(20,6),flip(1)')] ).
cnf(23,plain,
$false,
inference(conflict,[status(thm)],[22,20]),
[iquote('conflict(22,20)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL133-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 4 11:02:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.42/1.09 ----- EQP 0.9e, May 2009 -----
% 0.42/1.09 The job began on n007.cluster.edu, Mon Jul 4 11:02:57 2022
% 0.42/1.09 The command was "./eqp09e".
% 0.42/1.09
% 0.42/1.09 set(prolog_style_variables).
% 0.42/1.09 set(lrpo).
% 0.42/1.09 set(basic_paramod).
% 0.42/1.09 set(functional_subsume).
% 0.42/1.09 set(ordered_paramod).
% 0.42/1.09 set(prime_paramod).
% 0.42/1.09 set(para_pairs).
% 0.42/1.09 assign(pick_given_ratio,4).
% 0.42/1.09 clear(print_kept).
% 0.42/1.09 clear(print_new_demod).
% 0.42/1.09 clear(print_back_demod).
% 0.42/1.09 clear(print_given).
% 0.42/1.09 assign(max_mem,64000).
% 0.42/1.09 end_of_commands.
% 0.42/1.09
% 0.42/1.09 Usable:
% 0.42/1.09 end_of_list.
% 0.42/1.09
% 0.42/1.09 Sos:
% 0.42/1.09 0 (wt=-1) [] implies(truth,A) = A.
% 0.42/1.09 0 (wt=-1) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.42/1.09 0 (wt=-1) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.42/1.09 0 (wt=-1) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.42/1.09 0 (wt=-1) [] implies(A,B) = implies(B,A).
% 0.42/1.09 0 (wt=-1) [] -(x = y).
% 0.42/1.09 end_of_list.
% 0.42/1.09
% 0.42/1.09 Demodulators:
% 0.42/1.09 end_of_list.
% 0.42/1.09
% 0.42/1.09 Passive:
% 0.42/1.09 end_of_list.
% 0.42/1.09
% 0.42/1.09 Starting to process input.
% 0.42/1.09
% 0.42/1.09 ** KEPT: 1 (wt=5) [] implies(truth,A) = A.
% 0.42/1.09 1 is a new demodulator.
% 0.42/1.09
% 0.42/1.09 ** KEPT: 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.42/1.09 2 is a new demodulator.
% 0.42/1.09
% 0.42/1.09 ** KEPT: 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.42/1.09 clause forward subsumed: 0 (wt=11) [flip(3)] implies(implies(B,A),A) = implies(implies(A,B),B).
% 0.42/1.09
% 0.42/1.09 ** KEPT: 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.42/1.09 4 is a new demodulator.
% 0.42/1.09
% 0.42/1.09 ** KEPT: 5 (wt=7) [] implies(A,B) = implies(B,A).
% 0.42/1.09 clause forward subsumed: 0 (wt=7) [flip(5)] implies(B,A) = implies(A,B).
% 0.42/1.09
% 0.42/1.09 ** KEPT: 6 (wt=3) [flip(1)] -(y = x).
% 0.42/1.09 ---------------- PROOF FOUND ----------------
% 0.42/1.09 % SZS status Unsatisfiable
% 0.42/1.09
% 0.42/1.09
% 0.42/1.09 After processing input:
% 0.42/1.09
% 0.42/1.09 Usable:
% 0.42/1.09 end_of_list.
% 0.42/1.09
% 0.42/1.09 Sos:
% 0.42/1.09 6 (wt=3) [flip(1)] -(y = x).
% 0.42/1.09 1 (wt=5) [] implies(truth,A) = A.
% 0.42/1.09 5 (wt=7) [] implies(A,B) = implies(B,A).
% 0.42/1.09 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.42/1.09 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.42/1.09 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.42/1.09 end_of_list.
% 0.42/1.09
% 0.42/1.09 Demodulators:
% 0.42/1.09 1 (wt=5) [] implies(truth,A) = A.
% 0.42/1.09 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.42/1.09 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.42/1.09 end_of_list.
% 0.42/1.09
% 0.42/1.09 Passive:
% 0.42/1.09 end_of_list.
% 0.42/1.09
% 0.42/1.09 UNIT CONFLICT from 22 and 20 at 0.00 seconds.
% 0.42/1.09
% 0.42/1.09 ---------------- PROOF ----------------
% 0.42/1.09 % SZS output start Refutation
% See solution above
% 0.42/1.09 ------------ end of proof -------------
% 0.42/1.09
% 0.42/1.09
% 0.42/1.09 ------------- memory usage ------------
% 0.42/1.09 Memory dynamically allocated (tp_alloc): 488.
% 0.42/1.09 type (bytes each) gets frees in use avail bytes
% 0.42/1.09 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.42/1.09 term ( 16) 1157 921 236 15 4.8 K
% 0.42/1.09 gen_ptr ( 8) 1018 164 854 10 6.8 K
% 0.42/1.09 context ( 808) 477 475 2 2 3.2 K
% 0.42/1.09 trail ( 12) 100 100 0 4 0.0 K
% 0.42/1.09 bt_node ( 68) 142 141 1 10 0.7 K
% 0.42/1.09 ac_position (285432) 0 0 0 0 0.0 K
% 0.42/1.09 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.42/1.09 ac_match_free_vars_pos (4020)
% 0.42/1.09 0 0 0 0 0.0 K
% 0.42/1.09 discrim ( 12) 259 13 246 0 2.9 K
% 0.42/1.09 flat ( 40) 1136 1136 0 21 0.8 K
% 0.42/1.09 discrim_pos ( 12) 27 27 0 1 0.0 K
% 0.42/1.09 fpa_head ( 12) 112 0 112 0 1.3 K
% 0.42/1.09 fpa_tree ( 28) 61 61 0 7 0.2 K
% 0.42/1.09 fpa_pos ( 36) 38 38 0 1 0.0 K
% 0.42/1.09 literal ( 12) 63 41 22 1 0.3 K
% 0.42/1.09 clause ( 24) 63 41 22 1 0.5 K
% 0.42/1.09 list ( 12) 75 19 56 3 0.7 K
% 0.42/1.09 list_pos ( 20) 87 11 76 0 1.5 K
% 0.42/1.09 pair_index ( 40) 2 0 2 0 0.1 K
% 0.42/1.09
% 0.42/1.09 -------------- statistics -------------
% 0.42/1.09 Clauses input 6
% 0.42/1.09 Usable input 0
% 0.42/1.09 Sos input 6
% 0.42/1.09 Demodulators input 0
% 0.42/1.09 Passive input 0
% 0.42/1.09
% 0.42/1.09 Processed BS (before search) 8
% 0.42/1.09 Forward subsumed BS 2
% 0.42/1.09 Kept BS 6
% 0.42/1.09 New demodulators BS 3
% 0.42/1.09 Back demodulated BS 0
% 0.42/1.09
% 0.42/1.09 Clauses or pairs given 24
% 0.42/1.09 Clauses generated 32
% 0.42/1.09 Forward subsumed 16
% 0.42/1.09 Deleted by weight 0
% 0.42/1.09 Deleted by variable count 0
% 0.42/1.09 Kept 16
% 0.42/1.09 New demodulators 13
% 0.42/1.09 Back demodulated 1
% 0.42/1.09 Ordered paramod prunes 0
% 0.42/1.09 Basic paramod prunes 5
% 0.42/1.09 Prime paramod prunes 1
% 0.42/1.09 Semantic prunes 0
% 0.42/1.09
% 0.42/1.09 Rewrite attmepts 233
% 0.42/1.09 Rewrites 23
% 0.42/1.09
% 0.42/1.09 FPA overloads 0
% 0.42/1.09 FPA underloads 0
% 0.42/1.09
% 0.42/1.09 Usable size 0
% 0.42/1.09 Sos size 20
% 0.42/1.09 Demodulators size 15
% 0.42/1.09 Passive size 0
% 0.42/1.09 Disabled size 1
% 0.42/1.09
% 0.42/1.09 Proofs found 1
% 0.42/1.09
% 0.42/1.09 ----------- times (seconds) ----------- Mon Jul 4 11:02:57 2022
% 0.42/1.09
% 0.42/1.09 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.42/1.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.42/1.09 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.42/1.09 input time 0.00
% 0.42/1.09 paramodulation time 0.00
% 0.42/1.09 demodulation time 0.00
% 0.42/1.09 orient time 0.00
% 0.42/1.09 weigh time 0.00
% 0.42/1.09 forward subsume time 0.00
% 0.42/1.09 back demod find time 0.00
% 0.42/1.09 conflict time 0.00
% 0.42/1.09 LRPO time 0.00
% 0.42/1.09 store clause time 0.00
% 0.42/1.09 disable clause time 0.00
% 0.42/1.09 prime paramod time 0.00
% 0.42/1.09 semantics time 0.00
% 0.42/1.09
% 0.42/1.09 EQP interrupted
%------------------------------------------------------------------------------