TSTP Solution File: LCL161-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL161-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n016.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:23 EDT 2022
% Result : Unsatisfiable 0.70s 1.08s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 2 RR)
% Number of literals : 17 ( 0 equ; 1 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(not(A),xor(A,truth)),
file('LCL161-1.p',unknown),
[] ).
cnf(2,plain,
equal(xor(A,falsehood),A),
file('LCL161-1.p',unknown),
[] ).
cnf(3,plain,
equal(xor(A,A),falsehood),
file('LCL161-1.p',unknown),
[] ).
cnf(4,plain,
equal(and_star(A,truth),A),
file('LCL161-1.p',unknown),
[] ).
cnf(7,plain,
equal(xor(xor(A,truth),B),xor(A,xor(truth,B))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(9,plain,
equal(xor(A,B),xor(B,A)),
file('LCL161-1.p',unknown),
[] ).
cnf(11,plain,
equal(and_star(A,B),and_star(B,A)),
file('LCL161-1.p',unknown),
[] ).
cnf(12,plain,
equal(xor(truth,and_star(A,xor(truth,B))),implies(A,B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(13,plain,
~ equal(implies(truth,x),x),
file('LCL161-1.p',unknown),
[] ).
cnf(14,plain,
equal(xor(falsehood,A),A),
inference(para,[status(thm),theory(equality)],[9,2]),
[iquote('para(9,2)')] ).
cnf(16,plain,
equal(xor(truth,xor(truth,A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,7]),14]),1]),
[iquote('para(3,7),demod([14]),flip(1)')] ).
cnf(17,plain,
equal(and_star(truth,A),A),
inference(para,[status(thm),theory(equality)],[11,4]),
[iquote('para(11,4)')] ).
cnf(36,plain,
equal(xor(truth,A),implies(A,falsehood)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,12]),4]),
[iquote('para(2,12),demod([4])')] ).
cnf(46,plain,
equal(implies(implies(A,falsehood),falsehood),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[16]),36,36]),
[iquote('back_demod(16),demod([36,36])')] ).
cnf(47,plain,
equal(implies(and_star(A,implies(B,falsehood)),falsehood),implies(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[12]),36,36]),
[iquote('back_demod(12),demod([36,36])')] ).
cnf(80,plain,
equal(implies(truth,A),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,47]),46]),1]),
[iquote('para(17,47),demod([46]),flip(1)')] ).
cnf(81,plain,
$false,
inference(conflict,[status(thm)],[80,13]),
[iquote('conflict(80,13)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL161-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n016.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 13:56:47 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.70/1.08 ----- EQP 0.9e, May 2009 -----
% 0.70/1.08 The job began on n016.cluster.edu, Mon Jul 4 13:56:47 2022
% 0.70/1.08 The command was "./eqp09e".
% 0.70/1.08
% 0.70/1.08 set(prolog_style_variables).
% 0.70/1.08 set(lrpo).
% 0.70/1.08 set(basic_paramod).
% 0.70/1.08 set(functional_subsume).
% 0.70/1.08 set(ordered_paramod).
% 0.70/1.08 set(prime_paramod).
% 0.70/1.08 set(para_pairs).
% 0.70/1.08 assign(pick_given_ratio,4).
% 0.70/1.08 clear(print_kept).
% 0.70/1.08 clear(print_new_demod).
% 0.70/1.08 clear(print_back_demod).
% 0.70/1.08 clear(print_given).
% 0.70/1.08 assign(max_mem,64000).
% 0.70/1.08 end_of_commands.
% 0.70/1.08
% 0.70/1.08 Usable:
% 0.70/1.08 end_of_list.
% 0.70/1.08
% 0.70/1.08 Sos:
% 0.70/1.08 0 (wt=-1) [] not(A) = xor(A,truth).
% 0.70/1.08 0 (wt=-1) [] xor(A,falsehood) = A.
% 0.70/1.08 0 (wt=-1) [] xor(A,A) = falsehood.
% 0.70/1.08 0 (wt=-1) [] and_star(A,truth) = A.
% 0.70/1.08 0 (wt=-1) [] and_star(A,falsehood) = falsehood.
% 0.70/1.08 0 (wt=-1) [] and_star(xor(truth,A),A) = falsehood.
% 0.70/1.08 0 (wt=-1) [] xor(A,xor(truth,B)) = xor(xor(A,truth),B).
% 0.70/1.08 0 (wt=-1) [] and_star(xor(and_star(xor(truth,A),B),truth),B) = and_star(xor(and_star(xor(truth,B),A),truth),A).
% 0.70/1.08 0 (wt=-1) [] xor(A,B) = xor(B,A).
% 0.70/1.08 0 (wt=-1) [] and_star(and_star(A,B),C) = and_star(A,and_star(B,C)).
% 0.70/1.08 0 (wt=-1) [] and_star(A,B) = and_star(B,A).
% 0.70/1.08 0 (wt=-1) [] not(truth) = falsehood.
% 0.70/1.08 0 (wt=-1) [] implies(A,B) = xor(truth,and_star(A,xor(truth,B))).
% 0.70/1.08 0 (wt=-1) [] -(implies(truth,x) = x).
% 0.70/1.08 end_of_list.
% 0.70/1.08
% 0.70/1.08 Demodulators:
% 0.70/1.08 end_of_list.
% 0.70/1.08
% 0.70/1.08 Passive:
% 0.70/1.08 end_of_list.
% 0.70/1.08
% 0.70/1.08 Starting to process input.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 1 (wt=6) [] not(A) = xor(A,truth).
% 0.70/1.08 1 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 2 (wt=5) [] xor(A,falsehood) = A.
% 0.70/1.08 2 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 3 (wt=5) [] xor(A,A) = falsehood.
% 0.70/1.08 3 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 4 (wt=5) [] and_star(A,truth) = A.
% 0.70/1.08 4 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 5 (wt=5) [] and_star(A,falsehood) = falsehood.
% 0.70/1.08 5 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 6 (wt=7) [] and_star(xor(truth,A),A) = falsehood.
% 0.70/1.08 6 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 7 (wt=11) [flip(1)] xor(xor(A,truth),B) = xor(A,xor(truth,B)).
% 0.70/1.08 7 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 8 (wt=19) [] and_star(xor(and_star(xor(truth,A),B),truth),B) = and_star(xor(and_star(xor(truth,B),A),truth),A).
% 0.70/1.08 clause forward subsumed: 0 (wt=19) [flip(8)] and_star(xor(and_star(xor(truth,B),A),truth),A) = and_star(xor(and_star(xor(truth,A),B),truth),B).
% 0.70/1.08
% 0.70/1.08 ** KEPT: 9 (wt=7) [] xor(A,B) = xor(B,A).
% 0.70/1.08 clause forward subsumed: 0 (wt=7) [flip(9)] xor(B,A) = xor(A,B).
% 0.70/1.08
% 0.70/1.08 ** KEPT: 10 (wt=11) [] and_star(and_star(A,B),C) = and_star(A,and_star(B,C)).
% 0.70/1.08 10 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 11 (wt=7) [] and_star(A,B) = and_star(B,A).
% 0.70/1.08 clause forward subsumed: 0 (wt=7) [flip(11)] and_star(B,A) = and_star(A,B).
% 0.70/1.08 clause forward subsumed: 0 (wt=3) [demod([1,3])] falsehood = falsehood.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 12 (wt=11) [flip(1)] xor(truth,and_star(A,xor(truth,B))) = implies(A,B).
% 0.70/1.08 12 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 13 (wt=5) [] -(implies(truth,x) = x).
% 0.70/1.08 ---------------- PROOF FOUND ----------------
% 0.70/1.08 % SZS status Unsatisfiable
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 After processing input:
% 0.70/1.08
% 0.70/1.08 Usable:
% 0.70/1.08 end_of_list.
% 0.70/1.08
% 0.70/1.08 Sos:
% 0.70/1.08 2 (wt=5) [] xor(A,falsehood) = A.
% 0.70/1.08 3 (wt=5) [] xor(A,A) = falsehood.
% 0.70/1.08 4 (wt=5) [] and_star(A,truth) = A.
% 0.70/1.08 5 (wt=5) [] and_star(A,falsehood) = falsehood.
% 0.70/1.08 13 (wt=5) [] -(implies(truth,x) = x).
% 0.70/1.08 1 (wt=6) [] not(A) = xor(A,truth).
% 0.70/1.08 6 (wt=7) [] and_star(xor(truth,A),A) = falsehood.
% 0.70/1.08 9 (wt=7) [] xor(A,B) = xor(B,A).
% 0.70/1.08 11 (wt=7) [] and_star(A,B) = and_star(B,A).
% 0.70/1.08 7 (wt=11) [flip(1)] xor(xor(A,truth),B) = xor(A,xor(truth,B)).
% 0.70/1.08 10 (wt=11) [] and_star(and_star(A,B),C) = and_star(A,and_star(B,C)).
% 0.70/1.08 12 (wt=11) [flip(1)] xor(truth,and_star(A,xor(truth,B))) = implies(A,B).
% 0.70/1.08 8 (wt=19) [] and_star(xor(and_star(xor(truth,A),B),truth),B) = and_star(xor(and_star(xor(truth,B),A),truth),A).
% 0.70/1.08 end_of_list.
% 0.70/1.08
% 0.70/1.08 Demodulators:
% 0.70/1.08 1 (wt=6) [] not(A) = xor(A,truth).
% 0.70/1.08 2 (wt=5) [] xor(A,falsehood) = A.
% 0.70/1.08 3 (wt=5) [] xor(A,A) = falsehood.
% 0.70/1.08 4 (wt=5) [] and_star(A,truth) = A.
% 0.70/1.08 5 (wt=5) [] and_star(A,falsehood) = falsehood.
% 0.70/1.08 6 (wt=7) [] and_star(xor(truth,A),A) = falsehood.
% 0.70/1.08 7 (wt=11) [flip(1)] xor(xor(A,truth),B) = xor(A,xor(truth,B)).
% 0.70/1.08 10 (wt=11) [] and_star(and_star(A,B),C) = and_star(A,and_star(B,C)).
% 0.70/1.08 12 (wt=11) [flip(1)] xor(truth,and_star(A,xor(truth,B))) = implies(A,B).
% 0.70/1.08 end_of_list.
% 0.70/1.08
% 0.70/1.08 Passive:
% 0.70/1.08 end_of_list.
% 0.70/1.08
% 0.70/1.08 UNIT CONFLICT from 80 and 13 at 0.01 seconds.
% 0.70/1.08
% 0.70/1.08 ---------------- PROOF ----------------
% 0.70/1.08 % SZS output start Refutation
% See solution above
% 0.70/1.08 ------------ end of proof -------------
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 ------------- memory usage ------------
% 0.70/1.08 Memory dynamically allocated (tp_alloc): 488.
% 0.70/1.08 type (bytes each) gets frees in use avail bytes
% 0.70/1.08 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.70/1.08 term ( 16) 5389 4551 838 12 16.3 K
% 0.70/1.08 gen_ptr ( 8) 4693 1796 2897 16 22.8 K
% 0.70/1.08 context ( 808) 5621 5619 2 3 3.9 K
% 0.70/1.08 trail ( 12) 166 166 0 3 0.0 K
% 0.70/1.08 bt_node ( 68) 2163 2160 3 6 0.6 K
% 0.70/1.08 ac_position (285432) 0 0 0 0 0.0 K
% 0.70/1.08 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.70/1.08 ac_match_free_vars_pos (4020)
% 0.70/1.08 0 0 0 0 0.0 K
% 0.70/1.08 discrim ( 12) 630 310 320 34 4.1 K
% 0.70/1.08 flat ( 40) 6747 6747 0 19 0.7 K
% 0.70/1.08 discrim_pos ( 12) 337 337 0 1 0.0 K
% 0.70/1.08 fpa_head ( 12) 344 0 344 0 4.0 K
% 0.70/1.08 fpa_tree ( 28) 109 109 0 5 0.1 K
% 0.70/1.08 fpa_pos ( 36) 133 133 0 1 0.0 K
% 0.70/1.08 literal ( 12) 411 331 80 1 0.9 K
% 0.70/1.08 clause ( 24) 411 331 80 1 1.9 K
% 0.70/1.08 list ( 12) 112 56 56 3 0.7 K
% 0.70/1.08 list_pos ( 20) 371 172 199 0 3.9 K
% 0.70/1.08 pair_index ( 40) 2 0 2 0 0.1 K
% 0.70/1.08
% 0.70/1.08 -------------- statistics -------------
% 0.70/1.08 Clauses input 14
% 0.70/1.08 Usable input 0
% 0.70/1.08 Sos input 14
% 0.70/1.08 Demodulators input 0
% 0.70/1.08 Passive input 0
% 0.70/1.08
% 0.70/1.08 Processed BS (before search) 17
% 0.70/1.08 Forward subsumed BS 4
% 0.70/1.08 Kept BS 13
% 0.70/1.08 New demodulators BS 9
% 0.70/1.08 Back demodulated BS 0
% 0.70/1.08
% 0.70/1.08 Clauses or pairs given 476
% 0.70/1.08 Clauses generated 270
% 0.70/1.08 Forward subsumed 203
% 0.70/1.08 Deleted by weight 0
% 0.70/1.08 Deleted by variable count 0
% 0.70/1.08 Kept 67
% 0.70/1.08 New demodulators 44
% 0.70/1.08 Back demodulated 33
% 0.70/1.08 Ordered paramod prunes 0
% 0.70/1.08 Basic paramod prunes 386
% 0.70/1.08 Prime paramod prunes 20
% 0.70/1.08 Semantic prunes 0
% 0.70/1.08
% 0.70/1.08 Rewrite attmepts 2041
% 0.70/1.08 Rewrites 276
% 0.70/1.08
% 0.70/1.08 FPA overloads 0
% 0.70/1.08 FPA underloads 0
% 0.70/1.08
% 0.70/1.08 Usable size 0
% 0.70/1.08 Sos size 46
% 0.70/1.08 Demodulators size 28
% 0.70/1.08 Passive size 0
% 0.70/1.08 Disabled size 33
% 0.70/1.08
% 0.70/1.08 Proofs found 1
% 0.70/1.08
% 0.70/1.08 ----------- times (seconds) ----------- Mon Jul 4 13:56:47 2022
% 0.70/1.08
% 0.70/1.08 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.70/1.08 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.70/1.08 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.70/1.08 input time 0.00
% 0.70/1.08 paramodulation time 0.00
% 0.70/1.08 demodulation time 0.00
% 0.70/1.08 orient time 0.00
% 0.70/1.08 weigh time 0.00
% 0.70/1.08 forward subsume time 0.00
% 0.70/1.08 back demod find time 0.00
% 0.70/1.08 conflict time 0.00
% 0.70/1.08 LRPO time 0.00
% 0.70/1.08 store clause time 0.00
% 0.70/1.08 disable clause time 0.00
% 0.70/1.08 prime paramod time 0.00
% 0.70/1.08 semantics time 0.00
% 0.70/1.08
% 0.70/1.08 EQP interrupted
%------------------------------------------------------------------------------