%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : SWX233-1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n031.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 : 300s
% DateTime : Tue May 5 07:00:13 PM UTC 2026
% Result : Unsatisfiable 0.68s 1.09s
% Output : Refutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 7 unt; 0 nHn; 5 RR)
% Number of literals : 7 ( 0 equ; 2 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 3 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,plain,
equal(f(nil),btrue),
file('SWX233-1.p',unknown),
[] ).
cnf(9,plain,
equal(prop1(A),eq(f(A),bfalse)),
file('SWX233-1.p',unknown),
[] ).
cnf(11,plain,
equal(eq(btrue,bfalse),bfalse),
file('SWX233-1.p',unknown),
[] ).
cnf(12,plain,
equal(eq(A,A),btrue),
file('SWX233-1.p',unknown),
[] ).
cnf(13,plain,
~ equal(eq(eq(f(A),bfalse),bfalse),btrue),
inference(demod,[status(thm),theory(equality)],[9]),
[iquote('demod([9])')] ).
cnf(14,plain,
~ equal(btrue,btrue),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,13]),11,12]),
[iquote('para(7,13),demod([11,12])')] ).
cnf(15,plain,
$false,
inference(conflict,[status(thm)],[14]),
[iquote('xx_conflict(14)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWX233-1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.13 % Command : tptp2X_and_run_eqp %s
% 0.16/0.33 % Computer : n031.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 13:08:39 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.68/1.09 ----- EQP 0.9e, May 2009 -----
% 0.68/1.09 The job began on n031.cluster.edu, Tue May 5 13:08:39 2026
% 0.68/1.09 The command was "./eqp09e".
% 0.68/1.09
% 0.68/1.09 set(prolog_style_variables).
% 0.68/1.09 set(lrpo).
% 0.68/1.09 set(basic_paramod).
% 0.68/1.09 set(functional_subsume).
% 0.68/1.09 set(ordered_paramod).
% 0.68/1.09 set(prime_paramod).
% 0.68/1.09 set(para_pairs).
% 0.68/1.09 assign(pick_given_ratio,4).
% 0.68/1.09 clear(print_kept).
% 0.68/1.09 clear(print_new_demod).
% 0.68/1.09 clear(print_back_demod).
% 0.68/1.09 clear(print_given).
% 0.68/1.09 assign(max_mem,64000).
% 0.68/1.09 end_of_commands.
% 0.68/1.09
% 0.68/1.09 Usable:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Sos:
% 0.68/1.09 0 (wt=-1) [] aux(A,btrue) = bfalse.
% 0.68/1.09 0 (wt=-1) [] aux(A,bfalse) = btrue.
% 0.68/1.09 0 (wt=-1) [] h(nil) = nil.
% 0.68/1.09 0 (wt=-1) [] h(cons(A,B)) = B.
% 0.68/1.09 0 (wt=-1) [] g(btrue) = bfalse.
% 0.68/1.09 0 (wt=-1) [] g(bfalse) = btrue.
% 0.68/1.09 0 (wt=-1) [] f(nil) = btrue.
% 0.68/1.09 0 (wt=-1) [] f(cons(A,B)) = aux(B,f(B)).
% 0.68/1.09 0 (wt=-1) [] prop1(A) = eq(f(A),bfalse).
% 0.68/1.09 0 (wt=-1) [] eq(bfalse,btrue) = bfalse.
% 0.68/1.09 0 (wt=-1) [] eq(btrue,bfalse) = bfalse.
% 0.68/1.09 0 (wt=-1) [] eq(A,A) = btrue.
% 0.68/1.09 0 (wt=-1) [] -(eq(prop1(A),bfalse) = btrue).
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Demodulators:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Passive:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Starting to process input.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 1 (wt=5) [] aux(A,btrue) = bfalse.
% 0.68/1.09 1 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 2 (wt=5) [] aux(A,bfalse) = btrue.
% 0.68/1.09 2 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 3 (wt=4) [] h(nil) = nil.
% 0.68/1.09 3 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 4 (wt=6) [] h(cons(A,B)) = B.
% 0.68/1.09 4 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 5 (wt=4) [] g(btrue) = bfalse.
% 0.68/1.09 5 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 6 (wt=4) [] g(bfalse) = btrue.
% 0.68/1.09 6 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 7 (wt=4) [] f(nil) = btrue.
% 0.68/1.09 7 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 8 (wt=9) [] f(cons(A,B)) = aux(B,f(B)).
% 0.68/1.09 8 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 9 (wt=7) [] prop1(A) = eq(f(A),bfalse).
% 0.68/1.09 9 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 10 (wt=5) [] eq(bfalse,btrue) = bfalse.
% 0.68/1.09 10 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 11 (wt=5) [] eq(btrue,bfalse) = bfalse.
% 0.68/1.09 11 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 12 (wt=5) [] eq(A,A) = btrue.
% 0.68/1.09 12 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 13 (wt=8) [demod([9])] -(eq(eq(f(A),bfalse),bfalse) = btrue).
% 0.68/1.09 ---------------- PROOF FOUND ----------------
% 0.68/1.09 % SZS status Unsatisfiable
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 After processing input:
% 0.68/1.09
% 0.68/1.09 Usable:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Sos:
% 0.68/1.09 3 (wt=4) [] h(nil) = nil.
% 0.68/1.09 5 (wt=4) [] g(btrue) = bfalse.
% 0.68/1.09 6 (wt=4) [] g(bfalse) = btrue.
% 0.68/1.09 7 (wt=4) [] f(nil) = btrue.
% 0.68/1.09 1 (wt=5) [] aux(A,btrue) = bfalse.
% 0.68/1.09 2 (wt=5) [] aux(A,bfalse) = btrue.
% 0.68/1.09 10 (wt=5) [] eq(bfalse,btrue) = bfalse.
% 0.68/1.09 11 (wt=5) [] eq(btrue,bfalse) = bfalse.
% 0.68/1.09 12 (wt=5) [] eq(A,A) = btrue.
% 0.68/1.09 4 (wt=6) [] h(cons(A,B)) = B.
% 0.68/1.09 9 (wt=7) [] prop1(A) = eq(f(A),bfalse).
% 0.68/1.09 13 (wt=8) [demod([9])] -(eq(eq(f(A),bfalse),bfalse) = btrue).
% 0.68/1.09 8 (wt=9) [] f(cons(A,B)) = aux(B,f(B)).
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Demodulators:
% 0.68/1.09 1 (wt=5) [] aux(A,btrue) = bfalse.
% 0.68/1.09 2 (wt=5) [] aux(A,bfalse) = btrue.
% 0.68/1.09 3 (wt=4) [] h(nil) = nil.
% 0.68/1.09 4 (wt=6) [] h(cons(A,B)) = B.
% 0.68/1.09 5 (wt=4) [] g(btrue) = bfalse.
% 0.68/1.09 6 (wt=4) [] g(bfalse) = btrue.
% 0.68/1.09 7 (wt=4) [] f(nil) = btrue.
% 0.68/1.09 8 (wt=9) [] f(cons(A,B)) = aux(B,f(B)).
% 0.68/1.09 9 (wt=7) [] prop1(A) = eq(f(A),bfalse).
% 0.68/1.09 10 (wt=5) [] eq(bfalse,btrue) = bfalse.
% 0.68/1.09 11 (wt=5) [] eq(btrue,bfalse) = bfalse.
% 0.68/1.09 12 (wt=5) [] eq(A,A) = btrue.
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Passive:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 UNIT CONFLICT from 14 and x=x at 0.00 seconds.
% 0.68/1.09
% 0.68/1.09 ---------------- PROOF ----------------
% 0.68/1.09 % SZS output start Refutation
% See solution above
% 0.68/1.09 ------------ end of proof -------------
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 ------------- memory usage ------------
% 0.68/1.09 Memory dynamically allocated (tp_alloc): 488.
% 0.68/1.09 type (bytes each) gets frees in use avail bytes
% 0.68/1.09 sym_ent ( 96) 62 0 62 0 5.8 K
% 0.68/1.09 term ( 16) 657 579 78 9 1.6 K
% 0.68/1.09 gen_ptr ( 8) 302 96 206 6 1.7 K
% 0.68/1.09 context ( 808) 598 596 2 2 3.2 K
% 0.68/1.09 trail ( 12) 12 12 0 2 0.0 K
% 0.68/1.09 bt_node ( 68) 253 251 2 2 0.3 K
% 0.68/1.09 ac_position (285432) 0 0 0 0 0.0 K
% 0.68/1.09 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.68/1.09 ac_match_free_vars_pos (4020)
% 0.68/1.09 0 0 0 0 0.0 K
% 0.68/1.09 discrim ( 12) 82 0 82 0 1.0 K
% 0.68/1.09 flat ( 40) 160 160 0 5 0.2 K
% 0.68/1.09 discrim_pos ( 12) 3 3 0 1 0.0 K
% 0.68/1.09 fpa_head ( 12) 88 0 88 0 1.0 K
% 0.68/1.09 fpa_tree ( 28) 25 25 0 9 0.2 K
% 0.68/1.09 fpa_pos ( 36) 25 25 0 1 0.0 K
% 0.68/1.09 literal ( 12) 36 22 14 0 0.2 K
% 0.68/1.09 clause ( 24) 36 22 14 0 0.3 K
% 0.68/1.09 list ( 12) 71 15 56 3 0.7 K
% 0.68/1.09 list_pos ( 20) 64 13 51 0 1.0 K
% 0.68/1.09 pair_index ( 40) 2 0 2 0 0.1 K
% 0.68/1.09
% 0.68/1.09 -------------- statistics -------------
% 0.68/1.09 Clauses input 13
% 0.68/1.09 Usable input 0
% 0.68/1.09 Sos input 13
% 0.68/1.09 Demodulators input 0
% 0.68/1.09 Passive input 0
% 0.68/1.09
% 0.68/1.09 Processed BS (before search) 13
% 0.68/1.09 Forward subsumed BS 0
% 0.68/1.09 Kept BS 13
% 0.68/1.09 New demodulators BS 12
% 0.68/1.09 Back demodulated BS 0
% 0.68/1.09
% 0.68/1.09 Clauses or pairs given 72
% 0.68/1.09 Clauses generated 11
% 0.68/1.09 Forward subsumed 10
% 0.68/1.09 Deleted by weight 0
% 0.68/1.09 Deleted by variable count 0
% 0.68/1.09 Kept 1
% 0.68/1.09 New demodulators 0
% 0.68/1.09 Back demodulated 0
% 0.68/1.09 Ordered paramod prunes 0
% 0.68/1.09 Basic paramod prunes 0
% 0.68/1.09 Prime paramod prunes 0
% 0.68/1.09 Semantic prunes 0
% 0.68/1.09
% 0.68/1.09 Rewrite attmepts 95
% 0.68/1.09 Rewrites 3
% 0.68/1.09
% 0.68/1.09 FPA overloads 0
% 0.68/1.09 FPA underloads 0
% 0.68/1.09
% 0.68/1.09 Usable size 0
% 0.68/1.09 Sos size 13
% 0.68/1.09 Demodulators size 12
% 0.68/1.09 Passive size 0
% 0.68/1.09 Disabled size 0
% 0.68/1.09
% 0.68/1.09 Proofs found 1
% 0.68/1.09
% 0.68/1.09 ----------- times (seconds) ----------- Tue May 5 13:08:39 2026
% 0.68/1.09
% 0.68/1.09 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.68/1.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.68/1.09 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.68/1.09 input time 0.00
% 0.68/1.09 paramodulation time 0.00
% 0.68/1.09 demodulation time 0.00
% 0.68/1.09 orient time 0.00
% 0.68/1.09 weigh time 0.00
% 0.68/1.09 forward subsume time 0.00
% 0.68/1.09 back demod find time 0.00
% 0.68/1.09 conflict time 0.00
% 0.68/1.09 LRPO time 0.00
% 0.68/1.09 store clause time 0.00
% 0.68/1.09 disable clause time 0.00
% 0.68/1.09 prime paramod time 0.00
% 0.68/1.09 semantics time 0.00
% 0.68/1.09
% 0.68/1.09 EQP interrupted
%------------------------------------------------------------------------------