%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWB025+2 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:39:13 PM UTC 2026
% Result : Theorem 0.19s 10.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 42 ( 18 unt; 0 def)
% Number of atoms : 205 ( 0 equ)
% Maximal formula atoms : 53 ( 4 avg)
% Number of connectives : 271 ( 108 ~; 108 |; 50 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 22 ( 22 usr; 17 con; 0-5 aty)
% Number of variables : 92 ( 0 sgn 28 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_chain_002,axiom,
! [X1,X2,X3,X4,X5] :
( ( iext(uri_rdf_rest,X4,uri_rdf_nil)
& iext(uri_rdf_first,X4,X5)
& iext(uri_rdf_rest,X2,X4)
& iext(uri_rdf_first,X2,X3) )
=> ( iext(uri_owl_propertyChainAxiom,X1,X2)
<=> ( ! [X6,X7,X8] :
( ( iext(X5,X7,X8)
& iext(X3,X6,X7) )
=> iext(X1,X6,X8) )
& ip(X5)
& ip(X3)
& ip(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',owl_chain_002) ).
fof(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties,axiom,
? [X11,X12,X13,X14,X15] :
( iext(uri_ex_hasUncle,uri_ex_bob,uri_ex_dave)
& iext(uri_ex_hasFather,uri_ex_bob,uri_ex_charly)
& iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob)
& iext(uri_ex_hasFather,uri_ex_alice,uri_ex_dave)
& iext(uri_owl_inverseOf,X15,uri_ex_hasFather)
& iext(uri_rdf_rest,X14,uri_rdf_nil)
& iext(uri_rdf_first,X14,X15)
& iext(uri_rdf_rest,X13,X14)
& iext(uri_rdf_first,X13,uri_ex_hasUncle)
& iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,X13)
& iext(uri_rdf_rest,X12,uri_rdf_nil)
& iext(uri_rdf_first,X12,uri_ex_hasFather)
& iext(uri_rdf_rest,X11,X12)
& iext(uri_rdf_first,X11,uri_ex_hasCousin)
& iext(uri_owl_propertyChainAxiom,uri_ex_hasUncle,X11) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) ).
fof(owl_inv,axiom,
! [X3,X5] :
( iext(uri_owl_inverseOf,X3,X5)
<=> ( ! [X9,X10] :
( iext(X3,X9,X10)
<=> iext(X5,X10,X9) )
& ip(X5)
& ip(X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',owl_inv) ).
fof(testcase_conclusion_fullish_025_Cyclic_Dependencies_between_Complex_Properties,conjecture,
( iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice)
& iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_025_Cyclic_Dependencies_between_Complex_Properties) ).
fof(c_0_4,plain,
! [X16,X17,X18,X19,X20,X21,X22,X23] :
( ( ~ iext(uri_rdf_rest,X19,uri_rdf_nil)
| ~ iext(uri_rdf_first,X19,X20)
| ~ iext(uri_rdf_rest,X17,X19)
| ~ iext(uri_rdf_first,X17,X18)
| iext(uri_owl_propertyChainAxiom,X16,X17)
| ~ ip(X20)
| ~ ip(X18)
| ~ ip(X16)
| ~ iext(X16,esk1_5(X16,X17,X18,X19,X20),esk3_5(X16,X17,X18,X19,X20)) )
& ( ~ iext(uri_rdf_rest,X19,uri_rdf_nil)
| ~ iext(uri_rdf_first,X19,X20)
| ~ iext(uri_rdf_rest,X17,X19)
| ~ iext(uri_rdf_first,X17,X18)
| iext(uri_owl_propertyChainAxiom,X16,X17)
| ~ ip(X20)
| ~ ip(X18)
| ~ ip(X16)
| iext(X20,esk2_5(X16,X17,X18,X19,X20),esk3_5(X16,X17,X18,X19,X20)) )
& ( ~ iext(uri_rdf_rest,X19,uri_rdf_nil)
| ~ iext(uri_rdf_first,X19,X20)
| ~ iext(uri_rdf_rest,X17,X19)
| ~ iext(uri_rdf_first,X17,X18)
| iext(uri_owl_propertyChainAxiom,X16,X17)
| ~ ip(X20)
| ~ ip(X18)
| ~ ip(X16)
| iext(X18,esk1_5(X16,X17,X18,X19,X20),esk2_5(X16,X17,X18,X19,X20)) )
& ( ~ iext(uri_rdf_rest,X19,uri_rdf_nil)
| ~ iext(uri_rdf_first,X19,X20)
| ~ iext(uri_rdf_rest,X17,X19)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_owl_propertyChainAxiom,X16,X17)
| iext(X16,X21,X23)
| ~ iext(X20,X22,X23)
| ~ iext(X18,X21,X22) )
& ( ~ iext(uri_rdf_rest,X19,uri_rdf_nil)
| ~ iext(uri_rdf_first,X19,X20)
| ~ iext(uri_rdf_rest,X17,X19)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_owl_propertyChainAxiom,X16,X17)
| ip(X20) )
& ( ~ iext(uri_rdf_rest,X19,uri_rdf_nil)
| ~ iext(uri_rdf_first,X19,X20)
| ~ iext(uri_rdf_rest,X17,X19)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_owl_propertyChainAxiom,X16,X17)
| ip(X18) )
& ( ~ iext(uri_rdf_rest,X19,uri_rdf_nil)
| ~ iext(uri_rdf_first,X19,X20)
| ~ iext(uri_rdf_rest,X17,X19)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_owl_propertyChainAxiom,X16,X17)
| ip(X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_chain_002])])])])])]) ).
fof(c_0_5,plain,
( iext(uri_ex_hasUncle,uri_ex_bob,uri_ex_dave)
& iext(uri_ex_hasFather,uri_ex_bob,uri_ex_charly)
& iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob)
& iext(uri_ex_hasFather,uri_ex_alice,uri_ex_dave)
& iext(uri_owl_inverseOf,esk10_0,uri_ex_hasFather)
& iext(uri_rdf_rest,esk9_0,uri_rdf_nil)
& iext(uri_rdf_first,esk9_0,esk10_0)
& iext(uri_rdf_rest,esk8_0,esk9_0)
& iext(uri_rdf_first,esk8_0,uri_ex_hasUncle)
& iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,esk8_0)
& iext(uri_rdf_rest,esk7_0,uri_rdf_nil)
& iext(uri_rdf_first,esk7_0,uri_ex_hasFather)
& iext(uri_rdf_rest,esk6_0,esk7_0)
& iext(uri_rdf_first,esk6_0,uri_ex_hasCousin)
& iext(uri_owl_propertyChainAxiom,uri_ex_hasUncle,esk6_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties])]) ).
cnf(c_0_6,plain,
( ~ iext(uri_rdf_rest,X8,uri_rdf_nil)
| ~ iext(uri_rdf_first,X8,X4)
| ~ iext(uri_rdf_rest,X7,X8)
| ~ iext(uri_rdf_first,X7,X1)
| ~ iext(uri_owl_propertyChainAxiom,X6,X7)
| ~ iext(X4,X3,X5)
| ~ iext(X1,X2,X3)
| iext(X6,X2,X5) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
iext(uri_rdf_rest,esk9_0,uri_rdf_nil),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ~ iext(X6,X2,X7)
| ~ iext(X4,X7,X3)
| ~ iext(uri_owl_propertyChainAxiom,X1,X5)
| ~ iext(uri_rdf_first,X5,X6)
| ~ iext(uri_rdf_rest,X5,esk9_0)
| ~ iext(uri_rdf_first,esk9_0,X4)
| iext(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
iext(uri_rdf_first,esk9_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ iext(X5,X2,X6)
| ~ iext(esk10_0,X6,X3)
| ~ iext(uri_owl_propertyChainAxiom,X1,X4)
| ~ iext(uri_rdf_first,X4,X5)
| ~ iext(uri_rdf_rest,X4,esk9_0)
| iext(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
iext(uri_rdf_first,esk8_0,uri_ex_hasUncle),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
iext(uri_rdf_rest,esk8_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_13,plain,
! [X27,X28,X29,X30,X31,X32,X33,X34] :
( ( iext(uri_owl_inverseOf,X33,X34)
| ~ ip(X34)
| ~ ip(X33)
| iext(X34,esk5_2(X33,X34),esk4_2(X33,X34))
| iext(X33,esk4_2(X33,X34),esk5_2(X33,X34)) )
& ( iext(uri_owl_inverseOf,X33,X34)
| ~ ip(X34)
| ~ ip(X33)
| ~ iext(X34,esk5_2(X33,X34),esk4_2(X33,X34))
| ~ iext(X33,esk4_2(X33,X34),esk5_2(X33,X34)) )
& ( ~ iext(uri_owl_inverseOf,X27,X28)
| iext(X27,X31,X32)
| ~ iext(X28,X32,X31) )
& ( ~ iext(uri_owl_inverseOf,X27,X28)
| iext(X28,X30,X29)
| ~ iext(X27,X29,X30) )
& ( ~ iext(uri_owl_inverseOf,X27,X28)
| ip(X28) )
& ( ~ iext(uri_owl_inverseOf,X27,X28)
| ip(X27) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_inv])])])])])])]) ).
cnf(c_0_14,plain,
( ~ iext(uri_ex_hasUncle,X2,X4)
| ~ iext(esk10_0,X4,X3)
| ~ iext(uri_owl_propertyChainAxiom,X1,esk8_0)
| iext(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_15,plain,
iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
( ~ iext(uri_owl_inverseOf,X4,X1)
| ~ iext(X1,X2,X3)
| iext(X4,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
iext(uri_owl_inverseOf,esk10_0,uri_ex_hasFather),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,plain,
iext(uri_rdf_rest,esk7_0,uri_rdf_nil),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,plain,
( ~ iext(uri_ex_hasUncle,X1,X3)
| ~ iext(esk10_0,X3,X2)
| iext(uri_ex_hasCousin,X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ iext(uri_ex_hasFather,X2,X1)
| iext(esk10_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( ~ iext(X6,X2,X7)
| ~ iext(X4,X7,X3)
| ~ iext(uri_owl_propertyChainAxiom,X1,X5)
| ~ iext(uri_rdf_first,X5,X6)
| ~ iext(uri_rdf_rest,X5,esk7_0)
| ~ iext(uri_rdf_first,esk7_0,X4)
| iext(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_6,c_0_18]) ).
cnf(c_0_22,plain,
iext(uri_rdf_first,esk7_0,uri_ex_hasFather),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_23,negated_conjecture,
~ ( iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice)
& iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_025_Cyclic_Dependencies_between_Complex_Properties]) ).
cnf(c_0_24,plain,
( ~ iext(uri_ex_hasFather,X2,X3)
| ~ iext(uri_ex_hasUncle,X1,X3)
| iext(uri_ex_hasCousin,X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
iext(uri_ex_hasUncle,uri_ex_bob,uri_ex_dave),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_26,plain,
( ~ iext(X5,X2,X6)
| ~ iext(uri_ex_hasFather,X6,X3)
| ~ iext(uri_owl_propertyChainAxiom,X1,X4)
| ~ iext(uri_rdf_first,X4,X5)
| ~ iext(uri_rdf_rest,X4,esk7_0)
| iext(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
iext(uri_rdf_first,esk6_0,uri_ex_hasCousin),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_28,plain,
iext(uri_rdf_rest,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_29,negated_conjecture,
( ~ iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice)
| ~ iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])]) ).
cnf(c_0_30,plain,
( ~ iext(uri_ex_hasFather,X1,uri_ex_dave)
| iext(uri_ex_hasCousin,uri_ex_bob,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
iext(uri_ex_hasFather,uri_ex_alice,uri_ex_dave),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_32,plain,
( ~ iext(uri_ex_hasCousin,X2,X4)
| ~ iext(uri_ex_hasFather,X4,X3)
| ~ iext(uri_owl_propertyChainAxiom,X1,esk6_0)
| iext(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_33,plain,
iext(uri_owl_propertyChainAxiom,uri_ex_hasUncle,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_34,negated_conjecture,
( ~ iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice)
| ~ iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,plain,
iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( ~ iext(uri_ex_hasCousin,X1,X3)
| ~ iext(uri_ex_hasFather,X3,X2)
| iext(uri_ex_hasUncle,X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
iext(uri_ex_hasFather,uri_ex_bob,uri_ex_charly),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_38,negated_conjecture,
~ iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_39,plain,
( ~ iext(uri_ex_hasCousin,X1,uri_ex_bob)
| iext(uri_ex_hasUncle,X1,uri_ex_charly) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWB025+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/10.43 % Computer : n004.cluster.edu
% 0.16/10.43 % Model : x86_64 x86_64
% 0.16/10.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/10.43 % Memory : 8046.5625MB
% 0.16/10.43 % OS : Linux 6.8.0-71-generic
% 0.16/10.43 % CPULimit : 300
% 0.16/10.43 % WCLimit : 300
% 0.16/10.43 % DateTime : Mon Sep 21 07:41:32 UTC 2026
% 0.16/10.43 % CPUTime :
% 0.16/10.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/10.48 Running first-order theorem proving
% 0.16/10.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/10.50 % Version: 3.5.1
% 0.19/10.50 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/10.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/10.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/10.50 % Starting new_bool_3 with 300s (1) cores
% 0.19/10.50 % Starting new_bool_1 with 300s (1) cores
% 0.19/10.50 % Starting sh5l with 300s (1) cores
% 0.19/10.50 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2623887 completed with status 0
% 0.19/10.50 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.19/10.50 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/10.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/10.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/10.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/10.50 % No SInE strategy applied
% 0.19/10.50 % Search class: FGHNF-FFMM33-SFFFFFNN
% 0.19/10.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/10.50 % Starting SubtermCWHack with 136s (1) cores
% 0.19/10.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.19/10.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.19/10.50 % Starting new_bool_3 with 136s (1) cores
% 0.19/10.50 % Starting new_bool_1 with 136s (1) cores
% 0.19/10.50 % SubtermCWHack with pid 2623894 completed with status 0
% 0.19/10.50 % Result found by SubtermCWHack
% 0.19/10.50 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/10.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/10.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/10.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/10.50 % No SInE strategy applied
% 0.19/10.50 % Search class: FGHNF-FFMM33-SFFFFFNN
% 0.19/10.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/10.50 % Starting SubtermCWHack with 136s (1) cores
% 0.19/10.50 % Preprocessing time : 0.001 s
% 0.19/10.50
% 0.19/10.50 % Proof found!
% 0.19/10.50 % SZS status Theorem
% 0.19/10.50 % SZS output start CNFRefutation
% See solution above
% 0.19/10.50 % Parsed axioms : 4
% 0.19/10.50 % Removed by relevancy pruning/SinE : 0
% 0.19/10.50 % Initial clauses : 29
% 0.19/10.50 % Removed in clause preprocessing : 0
% 0.19/10.50 % Initial clauses in saturation : 29
% 0.19/10.50 % Processed clauses : 128
% 0.19/10.50 % ...of these trivial : 0
% 0.19/10.50 % ...subsumed : 6
% 0.19/10.50 % ...remaining for further processing : 122
% 0.19/10.50 % Other redundant clauses eliminated : 0
% 0.19/10.50 % Clauses deleted for lack of memory : 0
% 0.19/10.50 % Backward-subsumed : 6
% 0.19/10.50 % Backward-rewritten : 6
% 0.19/10.50 % Generated clauses : 188
% 0.19/10.50 % ...of the previous two non-redundant : 167
% 0.19/10.50 % ...aggressively subsumed : 0
% 0.19/10.50 % Contextual simplify-reflections : 2
% 0.19/10.50 % Paramodulations : 188
% 0.19/10.50 % Factorizations : 0
% 0.19/10.50 % NegExts : 0
% 0.19/10.50 % Equation resolutions : 0
% 0.19/10.50 % Disequality decompositions : 0
% 0.19/10.50 % Total rewrite steps : 57
% 0.19/10.50 % ...of those cached : 47
% 0.19/10.50 % Propositional unsat checks : 0
% 0.19/10.50 % Propositional check models : 0
% 0.19/10.50 % Propositional check unsatisfiable : 0
% 0.19/10.50 % Propositional clauses : 0
% 0.19/10.50 % Propositional clauses after purity: 0
% 0.19/10.50 % Propositional unsat core size : 0
% 0.19/10.50 % Propositional preprocessing time : 0.000
% 0.19/10.50 % Propositional encoding time : 0.000
% 0.19/10.50 % Propositional solver time : 0.000
% 0.19/10.50 % Success case prop preproc time : 0.000
% 0.19/10.50 % Success case prop encoding time : 0.000
% 0.19/10.50 % Success case prop solver time : 0.000
% 0.19/10.50 % Current number of processed clauses : 110
% 0.19/10.50 % Positive orientable unit clauses : 21
% 0.19/10.50 % Positive unorientable unit clauses: 0
% 0.19/10.50 % Negative unit clauses : 1
% 0.19/10.50 % Non-unit-clauses : 88
% 0.19/10.50 % Current number of unprocessed clauses: 68
% 0.19/10.50 % ...number of literals in the above : 526
% 0.19/10.50 % Current number of archived formulas : 0
% 0.19/10.50 % Current number of archived clauses : 12
% 0.19/10.50 % Clause-clause subsumption calls (NU) : 2379
% 0.19/10.50 % Rec. Clause-clause subsumption calls : 766
% 0.19/10.50 % Non-unit clause-clause subsumptions : 14
% 0.19/10.50 % Unit Clause-clause subsumption calls : 58
% 0.19/10.50 % Rewrite failures with RHS unbound : 0
% 0.19/10.50 % BW rewrite match attempts : 5
% 0.19/10.50 % BW rewrite match successes : 4
% 0.19/10.50 % Condensation attempts : 0
% 0.19/10.50 % Condensation successes : 0
% 0.19/10.50 % Termbank termtop insertions : 6716
% 0.19/10.50 % Search garbage collected termcells : 400
% 0.19/10.50
% 0.19/10.50 % -------------------------------------------------
% 0.19/10.50 % User time : 0.008 s
% 0.19/10.50 % System time : 0.005 s
% 0.19/10.50 % Total time : 0.013 s
% 0.19/10.50 % Maximum resident set size: 3648 pages
% 0.19/10.50
% 0.19/10.50 % -------------------------------------------------
% 0.19/10.50 % User time : 0.040 s
% 0.19/10.50 % System time : 0.014 s
% 0.19/10.50 % Total time : 0.054 s
% 0.19/10.50 % Maximum resident set size: 4608 pages
% 0.19/10.50 % E exiting
%------------------------------------------------------------------------------