TSTP Solution File: SWB025+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWB025+2 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:36:56 EDT 2023
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 44 ( 19 unt; 0 def)
% Number of atoms : 213 ( 0 equ)
% Maximal formula atoms : 53 ( 4 avg)
% Number of connectives : 283 ( 114 ~; 114 |; 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 : 99 ( 0 sgn; 28 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_chain_002,axiom,
! [X1,X2,X3,X4,X5] :
( ( iext(uri_rdf_first,X2,X3)
& iext(uri_rdf_rest,X2,X4)
& iext(uri_rdf_first,X4,X5)
& iext(uri_rdf_rest,X4,uri_rdf_nil) )
=> ( iext(uri_owl_propertyChainAxiom,X1,X2)
<=> ( ip(X1)
& ip(X3)
& ip(X5)
& ! [X6,X7,X8] :
( ( iext(X3,X6,X7)
& iext(X5,X7,X8) )
=> iext(X1,X6,X8) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.oGkeNtrKE5/E---3.1_7086.p',owl_chain_002) ).
fof(testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties,axiom,
? [X11,X12,X13,X14,X15] :
( iext(uri_owl_propertyChainAxiom,uri_ex_hasUncle,X11)
& iext(uri_rdf_first,X11,uri_ex_hasCousin)
& iext(uri_rdf_rest,X11,X12)
& iext(uri_rdf_first,X12,uri_ex_hasFather)
& iext(uri_rdf_rest,X12,uri_rdf_nil)
& iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,X13)
& iext(uri_rdf_first,X13,uri_ex_hasUncle)
& iext(uri_rdf_rest,X13,X14)
& iext(uri_rdf_first,X14,X15)
& iext(uri_rdf_rest,X14,uri_rdf_nil)
& iext(uri_owl_inverseOf,X15,uri_ex_hasFather)
& iext(uri_ex_hasFather,uri_ex_alice,uri_ex_dave)
& iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob)
& iext(uri_ex_hasFather,uri_ex_bob,uri_ex_charly)
& iext(uri_ex_hasUncle,uri_ex_bob,uri_ex_dave) ),
file('/export/starexec/sandbox2/tmp/tmp.oGkeNtrKE5/E---3.1_7086.p',testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties) ).
fof(owl_inv,axiom,
! [X3,X5] :
( iext(uri_owl_inverseOf,X3,X5)
<=> ( ip(X3)
& ip(X5)
& ! [X9,X10] :
( iext(X3,X9,X10)
<=> iext(X5,X10,X9) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.oGkeNtrKE5/E---3.1_7086.p',owl_inv) ).
fof(testcase_conclusion_fullish_025_Cyclic_Dependencies_between_Complex_Properties,conjecture,
( iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly)
& iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice) ),
file('/export/starexec/sandbox2/tmp/tmp.oGkeNtrKE5/E---3.1_7086.p',testcase_conclusion_fullish_025_Cyclic_Dependencies_between_Complex_Properties) ).
fof(c_0_4,plain,
! [X16,X17,X18,X19,X20,X21,X22,X23] :
( ( ip(X16)
| ~ iext(uri_owl_propertyChainAxiom,X16,X17)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_rdf_rest,X17,X19)
| ~ iext(uri_rdf_first,X19,X20)
| ~ iext(uri_rdf_rest,X19,uri_rdf_nil) )
& ( ip(X18)
| ~ iext(uri_owl_propertyChainAxiom,X16,X17)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_rdf_rest,X17,X19)
| ~ iext(uri_rdf_first,X19,X20)
| ~ iext(uri_rdf_rest,X19,uri_rdf_nil) )
& ( ip(X20)
| ~ iext(uri_owl_propertyChainAxiom,X16,X17)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_rdf_rest,X17,X19)
| ~ iext(uri_rdf_first,X19,X20)
| ~ iext(uri_rdf_rest,X19,uri_rdf_nil) )
& ( ~ iext(X18,X21,X22)
| ~ iext(X20,X22,X23)
| iext(X16,X21,X23)
| ~ iext(uri_owl_propertyChainAxiom,X16,X17)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_rdf_rest,X17,X19)
| ~ iext(uri_rdf_first,X19,X20)
| ~ iext(uri_rdf_rest,X19,uri_rdf_nil) )
& ( iext(X18,esk1_5(X16,X17,X18,X19,X20),esk2_5(X16,X17,X18,X19,X20))
| ~ ip(X16)
| ~ ip(X18)
| ~ ip(X20)
| iext(uri_owl_propertyChainAxiom,X16,X17)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_rdf_rest,X17,X19)
| ~ iext(uri_rdf_first,X19,X20)
| ~ iext(uri_rdf_rest,X19,uri_rdf_nil) )
& ( iext(X20,esk2_5(X16,X17,X18,X19,X20),esk3_5(X16,X17,X18,X19,X20))
| ~ ip(X16)
| ~ ip(X18)
| ~ ip(X20)
| iext(uri_owl_propertyChainAxiom,X16,X17)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_rdf_rest,X17,X19)
| ~ iext(uri_rdf_first,X19,X20)
| ~ iext(uri_rdf_rest,X19,uri_rdf_nil) )
& ( ~ iext(X16,esk1_5(X16,X17,X18,X19,X20),esk3_5(X16,X17,X18,X19,X20))
| ~ ip(X16)
| ~ ip(X18)
| ~ ip(X20)
| iext(uri_owl_propertyChainAxiom,X16,X17)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_rdf_rest,X17,X19)
| ~ iext(uri_rdf_first,X19,X20)
| ~ iext(uri_rdf_rest,X19,uri_rdf_nil) ) ),
inference(distribute,[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_owl_propertyChainAxiom,uri_ex_hasUncle,esk6_0)
& iext(uri_rdf_first,esk6_0,uri_ex_hasCousin)
& iext(uri_rdf_rest,esk6_0,esk7_0)
& iext(uri_rdf_first,esk7_0,uri_ex_hasFather)
& iext(uri_rdf_rest,esk7_0,uri_rdf_nil)
& iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,esk8_0)
& iext(uri_rdf_first,esk8_0,uri_ex_hasUncle)
& iext(uri_rdf_rest,esk8_0,esk9_0)
& iext(uri_rdf_first,esk9_0,esk10_0)
& iext(uri_rdf_rest,esk9_0,uri_rdf_nil)
& iext(uri_owl_inverseOf,esk10_0,uri_ex_hasFather)
& iext(uri_ex_hasFather,uri_ex_alice,uri_ex_dave)
& iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob)
& iext(uri_ex_hasFather,uri_ex_bob,uri_ex_charly)
& iext(uri_ex_hasUncle,uri_ex_bob,uri_ex_dave) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_025_Cyclic_Dependencies_between_Complex_Properties])]) ).
cnf(c_0_6,plain,
( iext(X6,X2,X5)
| ~ iext(X1,X2,X3)
| ~ iext(X4,X3,X5)
| ~ iext(uri_owl_propertyChainAxiom,X6,X7)
| ~ iext(uri_rdf_first,X7,X1)
| ~ iext(uri_rdf_rest,X7,X8)
| ~ iext(uri_rdf_first,X8,X4)
| ~ iext(uri_rdf_rest,X8,uri_rdf_nil) ),
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(X1,X2,X3)
| ~ iext(uri_rdf_first,esk9_0,X4)
| ~ iext(uri_rdf_rest,X5,esk9_0)
| ~ iext(uri_rdf_first,X5,X6)
| ~ iext(uri_owl_propertyChainAxiom,X1,X5)
| ~ iext(X4,X7,X3)
| ~ iext(X6,X2,X7) ),
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(uri_rdf_rest,esk7_0,uri_rdf_nil),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( iext(X1,X2,X3)
| ~ iext(uri_rdf_rest,X4,esk9_0)
| ~ iext(uri_rdf_first,X4,X5)
| ~ iext(uri_owl_propertyChainAxiom,X1,X4)
| ~ iext(esk10_0,X6,X3)
| ~ iext(X5,X2,X6) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
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] :
( ( ip(X27)
| ~ iext(uri_owl_inverseOf,X27,X28) )
& ( ip(X28)
| ~ iext(uri_owl_inverseOf,X27,X28) )
& ( ~ iext(X27,X29,X30)
| iext(X28,X30,X29)
| ~ iext(uri_owl_inverseOf,X27,X28) )
& ( ~ iext(X28,X32,X31)
| iext(X27,X31,X32)
| ~ iext(uri_owl_inverseOf,X27,X28) )
& ( ~ iext(X33,esk4_2(X33,X34),esk5_2(X33,X34))
| ~ iext(X34,esk5_2(X33,X34),esk4_2(X33,X34))
| ~ ip(X33)
| ~ ip(X34)
| iext(uri_owl_inverseOf,X33,X34) )
& ( iext(X33,esk4_2(X33,X34),esk5_2(X33,X34))
| iext(X34,esk5_2(X33,X34),esk4_2(X33,X34))
| ~ ip(X33)
| ~ ip(X34)
| iext(uri_owl_inverseOf,X33,X34) ) ),
inference(distribute,[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(X1,X2,X3)
| ~ iext(uri_rdf_first,esk7_0,X4)
| ~ iext(uri_rdf_rest,X5,esk7_0)
| ~ iext(uri_rdf_first,X5,X6)
| ~ iext(uri_owl_propertyChainAxiom,X1,X5)
| ~ iext(X4,X7,X3)
| ~ iext(X6,X2,X7) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_15,plain,
iext(uri_rdf_first,esk7_0,uri_ex_hasFather),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
( iext(X1,X2,X3)
| ~ iext(uri_rdf_first,esk8_0,X4)
| ~ iext(uri_owl_propertyChainAxiom,X1,esk8_0)
| ~ iext(esk10_0,X5,X3)
| ~ iext(X4,X2,X5) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
iext(uri_rdf_first,esk8_0,uri_ex_hasUncle),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,plain,
( iext(X4,X3,X2)
| ~ iext(X1,X2,X3)
| ~ iext(uri_owl_inverseOf,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
iext(uri_owl_inverseOf,esk10_0,uri_ex_hasFather),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,plain,
( iext(X1,X2,X3)
| ~ iext(uri_rdf_rest,X4,esk7_0)
| ~ iext(uri_rdf_first,X4,X5)
| ~ iext(uri_owl_propertyChainAxiom,X1,X4)
| ~ iext(uri_ex_hasFather,X6,X3)
| ~ iext(X5,X2,X6) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
iext(uri_rdf_rest,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,plain,
( iext(X1,X2,X3)
| ~ iext(uri_owl_propertyChainAxiom,X1,esk8_0)
| ~ iext(esk10_0,X4,X3)
| ~ iext(uri_ex_hasUncle,X2,X4) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_24,plain,
( iext(esk10_0,X1,X2)
| ~ iext(uri_ex_hasFather,X2,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
iext(uri_ex_hasFather,uri_ex_alice,uri_ex_dave),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_26,plain,
( iext(X1,X2,X3)
| ~ iext(uri_rdf_first,esk6_0,X4)
| ~ iext(uri_owl_propertyChainAxiom,X1,esk6_0)
| ~ iext(uri_ex_hasFather,X5,X3)
| ~ iext(X4,X2,X5) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
iext(uri_rdf_first,esk6_0,uri_ex_hasCousin),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_28,negated_conjecture,
~ ( iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly)
& iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_025_Cyclic_Dependencies_between_Complex_Properties]) ).
cnf(c_0_29,plain,
( iext(uri_ex_hasCousin,X1,X2)
| ~ iext(esk10_0,X3,X2)
| ~ iext(uri_ex_hasUncle,X1,X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
iext(esk10_0,uri_ex_dave,uri_ex_alice),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( iext(X1,X2,X3)
| ~ iext(uri_owl_propertyChainAxiom,X1,esk6_0)
| ~ iext(uri_ex_hasFather,X4,X3)
| ~ iext(uri_ex_hasCousin,X2,X4) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
iext(uri_owl_propertyChainAxiom,uri_ex_hasUncle,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_33,negated_conjecture,
( ~ iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly)
| ~ iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice) ),
inference(fof_nnf,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
( iext(uri_ex_hasCousin,X1,uri_ex_alice)
| ~ iext(uri_ex_hasUncle,X1,uri_ex_dave) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
iext(uri_ex_hasUncle,uri_ex_bob,uri_ex_dave),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_36,plain,
( iext(uri_ex_hasUncle,X1,X2)
| ~ iext(uri_ex_hasFather,X3,X2)
| ~ iext(uri_ex_hasCousin,X1,X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
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)
| ~ iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,plain,
iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
( iext(uri_ex_hasUncle,X1,uri_ex_charly)
| ~ iext(uri_ex_hasCousin,X1,uri_ex_bob) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_42,negated_conjecture,
~ iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_43,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWB025+2 : TPTP v8.1.2. Released v5.2.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n006.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 20:21:25 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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/tmp/tmp.oGkeNtrKE5/E---3.1_7086.p
% 0.21/0.50 # Version: 3.1pre001
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 7164 completed with status 0
% 0.21/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHNF-FFMM33-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.50 # Starting sh5l with 136s (1) cores
% 0.21/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 7172 completed with status 0
% 0.21/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGHNF-FFMM33-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 4
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 29
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 29
% 0.21/0.51 # Processed clauses : 101
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 101
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 6
% 0.21/0.51 # Backward-rewritten : 3
% 0.21/0.51 # Generated clauses : 67
% 0.21/0.51 # ...of the previous two non-redundant : 61
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 67
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Total rewrite steps : 10
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 63
% 0.21/0.51 # Positive orientable unit clauses : 22
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 1
% 0.21/0.51 # Non-unit-clauses : 40
% 0.21/0.51 # Current number of unprocessed clauses: 18
% 0.21/0.51 # ...number of literals in the above : 88
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 38
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 1249
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 255
% 0.21/0.51 # Non-unit clause-clause subsumptions : 6
% 0.21/0.51 # Unit Clause-clause subsumption calls : 47
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 3
% 0.21/0.51 # BW rewrite match successes : 3
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 3790
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.008 s
% 0.21/0.51 # System time : 0.002 s
% 0.21/0.51 # Total time : 0.010 s
% 0.21/0.51 # Maximum resident set size: 1772 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.038 s
% 0.21/0.51 # System time : 0.006 s
% 0.21/0.51 # Total time : 0.044 s
% 0.21/0.51 # Maximum resident set size: 1696 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------