TSTP Solution File: CSR115+9 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR115+9 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 : Sat May 4 07:34:15 EDT 2024
% Result : Theorem 2.60s 3.02s
% Output : CNFRefutation 2.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 10 unt; 0 def)
% Number of atoms : 356 ( 0 equ)
% Maximal formula atoms : 246 ( 11 avg)
% Number of connectives : 385 ( 60 ~; 49 |; 273 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 246 ( 13 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 23 ( 22 usr; 1 prp; 0-12 aty)
% Number of functors : 68 ( 68 usr; 63 con; 0-3 aty)
% Number of variables : 76 ( 29 sgn 20 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_007_mira_news_1106_a19984,conjecture,
? [X1,X2,X3,X4,X5,X6] :
( attr(X3,X2)
& attr(X5,X6)
& obj(X4,X1)
& prop(X1,britisch__1_1)
& sub(X1,firma_1_1)
& sub(X2,name_1_1)
& val(X2,bmw_0) ),
file('/export/starexec/sandbox/tmp/tmp.c3jy9EdPFS/E---3.1_1929.p',synth_qa07_007_mira_news_1106_a19984) ).
fof(ave07_era5_synth_qa07_007_mira_news_1106_a19984,hypothesis,
( subs(c57187,einigung_1_1)
& attr(c57201,c57202)
& sub(c57201,firma_1_1)
& sub(c57202,name_1_1)
& val(c57202,bmw_0)
& attr(c57288,c57289)
& attr(c57288,c59030)
& sub(c57288,firma_1_1)
& sub(c57289,name_1_1)
& val(c57289,honda_0)
& pred(c57295,rover_1_1)
& preds(c57299,bem__374hen_3_1)
& prop(c57299,langfristig_1_1)
& sub(c57309,vorzeitigkeit_1_1)
& attr(c58967,c58968)
& sub(c58967,firma_1_1)
& sub(c58968,name_1_1)
& val(c58968,rover_0)
& prop(c58970,britisch__1_1)
& sub(c58970,firma_1_1)
& prop(c58978,eigen_1_1)
& sub(c58978,markenidentit__344t_1_1)
& sub(c59030,name_1_1)
& val(c59030,honda_0)
& attr(c59035,c59036)
& sub(c59035,stadt__1_1)
& sub(c59036,name_1_1)
& val(c59036,london_0)
& tupl_p12(c59878,c57187,c57201,c57288,c57295,c57299,c57309,c58967,c58970,c58978,c57288,c59035)
& assoc(markenidentit__344t_1_1,marken_0)
& sub(markenidentit__344t_1_1,analogie__1_1)
& sort(c57187,ad)
& card(c57187,int1)
& etype(c57187,int0)
& fact(c57187,real)
& gener(c57187,sp)
& quant(c57187,one)
& refer(c57187,det)
& varia(c57187,con)
& sort(einigung_1_1,ad)
& card(einigung_1_1,int1)
& etype(einigung_1_1,int0)
& fact(einigung_1_1,real)
& gener(einigung_1_1,ge)
& quant(einigung_1_1,one)
& refer(einigung_1_1,refer_c)
& varia(einigung_1_1,varia_c)
& sort(c57201,d)
& sort(c57201,io)
& card(c57201,int1)
& etype(c57201,int0)
& fact(c57201,real)
& gener(c57201,sp)
& quant(c57201,one)
& refer(c57201,det)
& varia(c57201,con)
& sort(c57202,na)
& card(c57202,int1)
& etype(c57202,int0)
& fact(c57202,real)
& gener(c57202,sp)
& quant(c57202,one)
& refer(c57202,indet)
& varia(c57202,varia_c)
& sort(firma_1_1,d)
& sort(firma_1_1,io)
& card(firma_1_1,int1)
& etype(firma_1_1,int0)
& fact(firma_1_1,real)
& gener(firma_1_1,ge)
& quant(firma_1_1,one)
& refer(firma_1_1,refer_c)
& varia(firma_1_1,varia_c)
& sort(name_1_1,na)
& card(name_1_1,int1)
& etype(name_1_1,int0)
& fact(name_1_1,real)
& gener(name_1_1,ge)
& quant(name_1_1,one)
& refer(name_1_1,refer_c)
& varia(name_1_1,varia_c)
& sort(bmw_0,fe)
& sort(c57288,d)
& sort(c57288,io)
& card(c57288,int1)
& etype(c57288,int0)
& fact(c57288,real)
& gener(c57288,sp)
& quant(c57288,one)
& refer(c57288,det)
& varia(c57288,con)
& sort(c57289,na)
& card(c57289,int1)
& etype(c57289,int0)
& fact(c57289,real)
& gener(c57289,sp)
& quant(c57289,one)
& refer(c57289,indet)
& varia(c57289,varia_c)
& sort(c59030,na)
& card(c59030,int1)
& etype(c59030,int0)
& fact(c59030,real)
& gener(c59030,sp)
& quant(c59030,one)
& refer(c59030,indet)
& varia(c59030,varia_c)
& sort(honda_0,fe)
& sort(c57295,d)
& card(c57295,cons(x_constant,cons(int1,nil)))
& etype(c57295,int1)
& fact(c57295,real)
& gener(c57295,gener_c)
& quant(c57295,mult)
& refer(c57295,indet)
& varia(c57295,varia_c)
& sort(rover_1_1,d)
& card(rover_1_1,int1)
& etype(rover_1_1,int0)
& fact(rover_1_1,real)
& gener(rover_1_1,ge)
& quant(rover_1_1,one)
& refer(rover_1_1,refer_c)
& varia(rover_1_1,varia_c)
& sort(c57299,ad)
& card(c57299,cons(x_constant,cons(int1,nil)))
& etype(c57299,int1)
& fact(c57299,real)
& gener(c57299,gener_c)
& quant(c57299,mult)
& refer(c57299,refer_c)
& varia(c57299,varia_c)
& sort(bem__374hen_3_1,ad)
& card(bem__374hen_3_1,int1)
& etype(bem__374hen_3_1,int0)
& fact(bem__374hen_3_1,real)
& gener(bem__374hen_3_1,ge)
& quant(bem__374hen_3_1,one)
& refer(bem__374hen_3_1,refer_c)
& varia(bem__374hen_3_1,varia_c)
& sort(langfristig_1_1,tq)
& sort(c57309,ta)
& card(c57309,int1)
& etype(c57309,int0)
& fact(c57309,real)
& gener(c57309,gener_c)
& quant(c57309,one)
& refer(c57309,refer_c)
& varia(c57309,varia_c)
& sort(vorzeitigkeit_1_1,ta)
& card(vorzeitigkeit_1_1,int1)
& etype(vorzeitigkeit_1_1,int0)
& fact(vorzeitigkeit_1_1,real)
& gener(vorzeitigkeit_1_1,ge)
& quant(vorzeitigkeit_1_1,one)
& refer(vorzeitigkeit_1_1,refer_c)
& varia(vorzeitigkeit_1_1,varia_c)
& sort(c58967,d)
& sort(c58967,io)
& card(c58967,int1)
& etype(c58967,int0)
& fact(c58967,real)
& gener(c58967,sp)
& quant(c58967,one)
& refer(c58967,det)
& varia(c58967,con)
& sort(c58968,na)
& card(c58968,int1)
& etype(c58968,int0)
& fact(c58968,real)
& gener(c58968,sp)
& quant(c58968,one)
& refer(c58968,indet)
& varia(c58968,varia_c)
& sort(rover_0,fe)
& sort(c58970,d)
& sort(c58970,io)
& card(c58970,int1)
& etype(c58970,int0)
& fact(c58970,real)
& gener(c58970,gener_c)
& quant(c58970,one)
& refer(c58970,refer_c)
& varia(c58970,varia_c)
& sort(britisch__1_1,nq)
& sort(c58978,io)
& card(c58978,int1)
& etype(c58978,int0)
& fact(c58978,real)
& gener(c58978,gener_c)
& quant(c58978,one)
& refer(c58978,refer_c)
& varia(c58978,varia_c)
& sort(eigen_1_1,nq)
& sort(markenidentit__344t_1_1,io)
& card(markenidentit__344t_1_1,int1)
& etype(markenidentit__344t_1_1,int0)
& fact(markenidentit__344t_1_1,real)
& gener(markenidentit__344t_1_1,ge)
& quant(markenidentit__344t_1_1,one)
& refer(markenidentit__344t_1_1,refer_c)
& varia(markenidentit__344t_1_1,varia_c)
& sort(c59035,d)
& sort(c59035,io)
& card(c59035,int1)
& etype(c59035,int0)
& fact(c59035,real)
& gener(c59035,sp)
& quant(c59035,one)
& refer(c59035,det)
& varia(c59035,con)
& sort(c59036,na)
& card(c59036,int1)
& etype(c59036,int0)
& fact(c59036,real)
& gener(c59036,sp)
& quant(c59036,one)
& refer(c59036,indet)
& varia(c59036,varia_c)
& sort(stadt__1_1,d)
& sort(stadt__1_1,io)
& card(stadt__1_1,int1)
& etype(stadt__1_1,int0)
& fact(stadt__1_1,real)
& gener(stadt__1_1,ge)
& quant(stadt__1_1,one)
& refer(stadt__1_1,refer_c)
& varia(stadt__1_1,varia_c)
& sort(london_0,fe)
& sort(c59878,ent)
& card(c59878,card_c)
& etype(c59878,etype_c)
& fact(c59878,real)
& gener(c59878,gener_c)
& quant(c59878,quant_c)
& refer(c59878,refer_c)
& varia(c59878,varia_c)
& sort(marken_0,fe)
& sort(analogie__1_1,io)
& card(analogie__1_1,int1)
& etype(analogie__1_1,int0)
& fact(analogie__1_1,real)
& gener(analogie__1_1,ge)
& quant(analogie__1_1,one)
& refer(analogie__1_1,refer_c)
& varia(analogie__1_1,varia_c) ),
file('/export/starexec/sandbox/tmp/tmp.c3jy9EdPFS/E---3.1_1929.p',ave07_era5_synth_qa07_007_mira_news_1106_a19984) ).
fof(loc__geben_1_1_loc,axiom,
! [X1,X2] :
( ( has_fact_leq(X2,real)
& loc(X2,X1) )
=> ? [X3] :
( loc(X3,X1)
& obj(X3,X2)
& subs(X3,geben_1_1) ) ),
file('/export/starexec/sandbox/tmp/tmp.c3jy9EdPFS/E---3.1_1929.p',loc__geben_1_1_loc) ).
fof(has_fact_eq,axiom,
! [X1,X2] :
( fact(X1,X2)
=> has_fact_leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.c3jy9EdPFS/E---3.1_1929.p',has_fact_eq) ).
fof(state_adjective__in_state,axiom,
! [X1,X2,X3] :
( ( prop(X1,X2)
& state_adjective_state_binding(X2,X3) )
=> ? [X4,X5,X6] :
( in(X6,X4)
& attr(X4,X5)
& loc(X1,X6)
& sub(X4,land_1_1)
& sub(X5,name_1_1)
& val(X5,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.c3jy9EdPFS/E---3.1_1929.p',state_adjective__in_state) ).
fof(fact_8846,axiom,
state_adjective_state_binding(britisch__1_1,grossbritannien_0),
file('/export/starexec/sandbox/tmp/tmp.c3jy9EdPFS/E---3.1_1929.p',fact_8846) ).
fof(c_0_6,negated_conjecture,
~ ? [X1,X2,X3,X4,X5,X6] :
( attr(X3,X2)
& attr(X5,X6)
& obj(X4,X1)
& prop(X1,britisch__1_1)
& sub(X1,firma_1_1)
& sub(X2,name_1_1)
& val(X2,bmw_0) ),
inference(assume_negation,[status(cth)],[synth_qa07_007_mira_news_1106_a19984]) ).
fof(c_0_7,negated_conjecture,
! [X8,X9,X10,X11,X12,X13] :
( ~ attr(X10,X9)
| ~ attr(X12,X13)
| ~ obj(X11,X8)
| ~ prop(X8,britisch__1_1)
| ~ sub(X8,firma_1_1)
| ~ sub(X9,name_1_1)
| ~ val(X9,bmw_0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_8,negated_conjecture,
( ~ attr(X1,X2)
| ~ attr(X3,X4)
| ~ obj(X5,X6)
| ~ prop(X6,britisch__1_1)
| ~ sub(X6,firma_1_1)
| ~ sub(X2,name_1_1)
| ~ val(X2,bmw_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_9,hypothesis,
val(c57202,bmw_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1106_a19984]) ).
cnf(c_0_10,hypothesis,
sub(c57202,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1106_a19984]) ).
cnf(c_0_11,hypothesis,
( ~ prop(X1,britisch__1_1)
| ~ attr(X2,c57202)
| ~ attr(X3,X4)
| ~ obj(X5,X1)
| ~ sub(X1,firma_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_12,hypothesis,
prop(c58970,britisch__1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1106_a19984]) ).
cnf(c_0_13,hypothesis,
sub(c58970,firma_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1106_a19984]) ).
cnf(c_0_14,hypothesis,
( ~ attr(X1,c57202)
| ~ attr(X2,X3)
| ~ obj(X4,c58970) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_15,hypothesis,
attr(c57201,c57202),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1106_a19984]) ).
fof(c_0_16,plain,
! [X98,X99] :
( ( loc(esk12_2(X98,X99),X98)
| ~ has_fact_leq(X99,real)
| ~ loc(X99,X98) )
& ( obj(esk12_2(X98,X99),X99)
| ~ has_fact_leq(X99,real)
| ~ loc(X99,X98) )
& ( subs(esk12_2(X98,X99),geben_1_1)
| ~ has_fact_leq(X99,real)
| ~ loc(X99,X98) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[loc__geben_1_1_loc])])])])]) ).
cnf(c_0_17,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,c58970) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( obj(esk12_2(X1,X2),X2)
| ~ has_fact_leq(X2,real)
| ~ loc(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X86,X87] :
( ~ fact(X86,X87)
| has_fact_leq(X86,X87) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[has_fact_eq])])]) ).
cnf(c_0_20,hypothesis,
( ~ attr(X1,X2)
| ~ loc(c58970,X3)
| ~ has_fact_leq(c58970,real) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( has_fact_leq(X1,X2)
| ~ fact(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,hypothesis,
fact(c58970,real),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1106_a19984]) ).
fof(c_0_23,plain,
! [X38,X39,X40] :
( ( in(esk9_3(X38,X39,X40),esk7_3(X38,X39,X40))
| ~ prop(X38,X39)
| ~ state_adjective_state_binding(X39,X40) )
& ( attr(esk7_3(X38,X39,X40),esk8_3(X38,X39,X40))
| ~ prop(X38,X39)
| ~ state_adjective_state_binding(X39,X40) )
& ( loc(X38,esk9_3(X38,X39,X40))
| ~ prop(X38,X39)
| ~ state_adjective_state_binding(X39,X40) )
& ( sub(esk7_3(X38,X39,X40),land_1_1)
| ~ prop(X38,X39)
| ~ state_adjective_state_binding(X39,X40) )
& ( sub(esk8_3(X38,X39,X40),name_1_1)
| ~ prop(X38,X39)
| ~ state_adjective_state_binding(X39,X40) )
& ( val(esk8_3(X38,X39,X40),X40)
| ~ prop(X38,X39)
| ~ state_adjective_state_binding(X39,X40) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[state_adjective__in_state])])])])])]) ).
cnf(c_0_24,hypothesis,
( ~ attr(X1,X2)
| ~ loc(c58970,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_25,plain,
( loc(X1,esk9_3(X1,X2,X3))
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,hypothesis,
( ~ state_adjective_state_binding(X1,X2)
| ~ prop(c58970,X1)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,hypothesis,
( ~ state_adjective_state_binding(britisch__1_1,X1)
| ~ attr(X2,X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_12]) ).
cnf(c_0_28,plain,
state_adjective_state_binding(britisch__1_1,grossbritannien_0),
inference(split_conjunct,[status(thm)],[fact_8846]) ).
cnf(c_0_29,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_15,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.24/1.29 % Problem : CSR115+9 : TPTP v8.1.2. Released v4.0.0.
% 1.24/1.30 % Command : run_E %s %d THM
% 1.30/1.49 % Computer : n027.cluster.edu
% 1.30/1.49 % Model : x86_64 x86_64
% 1.30/1.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.30/1.49 % Memory : 8042.1875MB
% 1.30/1.49 % OS : Linux 3.10.0-693.el7.x86_64
% 1.30/1.49 % CPULimit : 300
% 1.30/1.49 % WCLimit : 300
% 1.30/1.49 % DateTime : Fri May 3 15:16:39 EDT 2024
% 1.30/1.50 % CPUTime :
% 2.52/2.71 Running first-order theorem proving
% 2.52/2.71 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.c3jy9EdPFS/E---3.1_1929.p
% 2.60/3.02 # Version: 3.1.0
% 2.60/3.02 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.60/3.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.60/3.02 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.60/3.02 # Starting new_bool_3 with 300s (1) cores
% 2.60/3.02 # Starting new_bool_1 with 300s (1) cores
% 2.60/3.02 # Starting sh5l with 300s (1) cores
% 2.60/3.02 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 2007 completed with status 0
% 2.60/3.02 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 2.60/3.02 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.60/3.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.60/3.02 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.60/3.02 # SinE strategy is gf500_h_gu_R04_F100_L20000
% 2.60/3.02 # Search class: FHHNS-FSLM32-MFFFFFNN
% 2.60/3.02 # partial match(2): FHHNS-SMLM32-MFFFFFNN
% 2.60/3.02 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.60/3.02 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 2.60/3.02 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 2.60/3.02 # Starting new_bool_3 with 136s (1) cores
% 2.60/3.02 # Starting new_bool_1 with 136s (1) cores
% 2.60/3.02 # Starting sh5l with 136s (1) cores
% 2.60/3.02 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2013 completed with status 0
% 2.60/3.02 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 2.60/3.02 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.60/3.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.60/3.02 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.60/3.02 # SinE strategy is gf500_h_gu_R04_F100_L20000
% 2.60/3.02 # Search class: FHHNS-FSLM32-MFFFFFNN
% 2.60/3.02 # partial match(2): FHHNS-SMLM32-MFFFFFNN
% 2.60/3.02 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.60/3.02 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 2.60/3.02 # Preprocessing time : 0.012 s
% 2.60/3.02 # Presaturation interreduction done
% 2.60/3.02
% 2.60/3.02 # Proof found!
% 2.60/3.02 # SZS status Theorem
% 2.60/3.02 # SZS output start CNFRefutation
% See solution above
% 2.60/3.02 # Parsed axioms : 10189
% 2.60/3.02 # Removed by relevancy pruning/SinE : 9939
% 2.60/3.02 # Initial clauses : 648
% 2.60/3.02 # Removed in clause preprocessing : 0
% 2.60/3.02 # Initial clauses in saturation : 648
% 2.60/3.02 # Processed clauses : 1245
% 2.60/3.02 # ...of these trivial : 0
% 2.60/3.02 # ...subsumed : 0
% 2.60/3.02 # ...remaining for further processing : 1245
% 2.60/3.02 # Other redundant clauses eliminated : 0
% 2.60/3.02 # Clauses deleted for lack of memory : 0
% 2.60/3.02 # Backward-subsumed : 10
% 2.60/3.02 # Backward-rewritten : 0
% 2.60/3.02 # Generated clauses : 362
% 2.60/3.02 # ...of the previous two non-redundant : 357
% 2.60/3.02 # ...aggressively subsumed : 0
% 2.60/3.02 # Contextual simplify-reflections : 0
% 2.60/3.02 # Paramodulations : 357
% 2.60/3.02 # Factorizations : 0
% 2.60/3.02 # NegExts : 0
% 2.60/3.02 # Equation resolutions : 0
% 2.60/3.02 # Disequality decompositions : 0
% 2.60/3.02 # Total rewrite steps : 3
% 2.60/3.02 # ...of those cached : 0
% 2.60/3.02 # Propositional unsat checks : 0
% 2.60/3.02 # Propositional check models : 0
% 2.60/3.02 # Propositional check unsatisfiable : 0
% 2.60/3.02 # Propositional clauses : 0
% 2.60/3.02 # Propositional clauses after purity: 0
% 2.60/3.02 # Propositional unsat core size : 0
% 2.60/3.02 # Propositional preprocessing time : 0.000
% 2.60/3.02 # Propositional encoding time : 0.000
% 2.60/3.02 # Propositional solver time : 0.000
% 2.60/3.02 # Success case prop preproc time : 0.000
% 2.60/3.02 # Success case prop encoding time : 0.000
% 2.60/3.02 # Success case prop solver time : 0.000
% 2.60/3.02 # Current number of processed clauses : 582
% 2.60/3.02 # Positive orientable unit clauses : 445
% 2.60/3.02 # Positive unorientable unit clauses: 0
% 2.60/3.02 # Negative unit clauses : 1
% 2.60/3.02 # Non-unit-clauses : 136
% 2.60/3.02 # Current number of unprocessed clauses: 408
% 2.60/3.02 # ...number of literals in the above : 1250
% 2.60/3.02 # Current number of archived formulas : 0
% 2.60/3.02 # Current number of archived clauses : 663
% 2.60/3.02 # Clause-clause subsumption calls (NU) : 23061
% 2.60/3.02 # Rec. Clause-clause subsumption calls : 6947
% 2.60/3.02 # Non-unit clause-clause subsumptions : 2
% 2.60/3.02 # Unit Clause-clause subsumption calls : 261
% 2.60/3.02 # Rewrite failures with RHS unbound : 0
% 2.60/3.02 # BW rewrite match attempts : 0
% 2.60/3.02 # BW rewrite match successes : 0
% 2.60/3.02 # Condensation attempts : 0
% 2.60/3.02 # Condensation successes : 0
% 2.60/3.02 # Termbank termtop insertions : 73954
% 2.60/3.02 # Search garbage collected termcells : 40688
% 2.60/3.02
% 2.60/3.02 # -------------------------------------------------
% 2.60/3.02 # User time : 0.115 s
% 2.60/3.02 # System time : 0.063 s
% 2.60/3.02 # Total time : 0.179 s
% 2.60/3.02 # Maximum resident set size: 48108 pages
% 2.60/3.02
% 2.60/3.02 # -------------------------------------------------
% 2.60/3.02 # User time : 0.574 s
% 2.60/3.02 # System time : 0.134 s
% 2.60/3.02 # Total time : 0.708 s
% 2.60/3.02 # Maximum resident set size: 10836 pages
% 2.60/3.02 % E---3.1 exiting
% 2.60/3.02 % E exiting
%------------------------------------------------------------------------------