TSTP Solution File: CSR115+36 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR115+36 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:01 EDT 2024
% Result : Theorem 2.36s 2.71s
% Output : CNFRefutation 2.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 7 unt; 0 def)
% Number of atoms : 200 ( 0 equ)
% Maximal formula atoms : 139 ( 12 avg)
% Number of connectives : 222 ( 38 ~; 30 |; 154 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 139 ( 14 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 21 ( 20 usr; 1 prp; 0-2 aty)
% Number of functors : 42 ( 42 usr; 42 con; 0-0 aty)
% Number of variables : 48 ( 17 sgn 7 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(synth_qa07_007_mira_news_1223,conjecture,
? [X1,X2,X3,X4,X5,X6,X7] :
( agt(X5,X4)
& attr(X1,X2)
& attr(X4,X3)
& attr(X6,X7)
& sub(X2,name_1_1)
& sub(X1,firma_1_1)
& sub(X3,name_1_1)
& val(X2,bmw_0)
& val(X3,bmw_0) ),
file('/export/starexec/sandbox2/tmp/tmp.06vzqZUFTL/E---3.1_28375.p',synth_qa07_007_mira_news_1223) ).
fof(ave07_era5_synth_qa07_007_mira_news_1223,hypothesis,
( assoc(autofirma_1_1,auto__1_1)
& sub(autofirma_1_1,firma_1_1)
& attr(c428,c429)
& sub(c428,firma_1_1)
& sub(c429,name_1_1)
& val(c429,bmw_0)
& prop(c434,britisch__1_1)
& sub(c434,autofirma_1_1)
& benf(c441,c452)
& pred(c441,beid_2_1)
& name(c452,die_vorhersehbare_zukunft_0)
& exp(c458,c441)
& obj(c458,c6)
& subs(c458,ausschlie__337en_1_1)
& agt(c6,c428)
& obj(c6,c434)
& subs(c6,kapitalbeteiligung_1_1)
& assoc(kapitalbeteiligung_1_1,kapital_2_1)
& subs(kapitalbeteiligung_1_1,beteiligung_1_1)
& sort(autofirma_1_1,d)
& sort(autofirma_1_1,io)
& card(autofirma_1_1,int1)
& etype(autofirma_1_1,int0)
& fact(autofirma_1_1,real)
& gener(autofirma_1_1,ge)
& quant(autofirma_1_1,one)
& refer(autofirma_1_1,refer_c)
& varia(autofirma_1_1,varia_c)
& sort(auto__1_1,d)
& card(auto__1_1,int1)
& etype(auto__1_1,int0)
& fact(auto__1_1,real)
& gener(auto__1_1,ge)
& quant(auto__1_1,one)
& refer(auto__1_1,refer_c)
& varia(auto__1_1,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(c428,d)
& sort(c428,io)
& card(c428,int1)
& etype(c428,int0)
& fact(c428,real)
& gener(c428,sp)
& quant(c428,one)
& refer(c428,det)
& varia(c428,con)
& sort(c429,na)
& card(c429,int1)
& etype(c429,int0)
& fact(c429,real)
& gener(c429,sp)
& quant(c429,one)
& refer(c429,indet)
& varia(c429,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(c434,d)
& sort(c434,io)
& card(c434,int1)
& etype(c434,int0)
& fact(c434,real)
& gener(c434,sp)
& quant(c434,one)
& refer(c434,det)
& varia(c434,con)
& sort(britisch__1_1,nq)
& sort(c441,o)
& card(c441,int2)
& etype(c441,int1)
& etype(c441,int2)
& etype(c441,int3)
& fact(c441,real)
& gener(c441,sp)
& quant(c441,both)
& refer(c441,indet)
& varia(c441,varia_c)
& sort(c452,o)
& card(c452,int1)
& etype(c452,int0)
& fact(c452,real)
& gener(c452,sp)
& quant(c452,one)
& refer(c452,refer_c)
& varia(c452,varia_c)
& sort(beid_2_1,o)
& card(beid_2_1,int2)
& etype(beid_2_1,int1)
& fact(beid_2_1,real)
& gener(beid_2_1,gener_c)
& quant(beid_2_1,both)
& refer(beid_2_1,refer_c)
& varia(beid_2_1,varia_c)
& sort(die_vorhersehbare_zukunft_0,fe)
& sort(c458,dn)
& fact(c458,real)
& gener(c458,sp)
& sort(c6,ad)
& card(c6,int1)
& etype(c6,int0)
& fact(c6,real)
& gener(c6,sp)
& quant(c6,one)
& refer(c6,indet)
& varia(c6,varia_c)
& sort(ausschlie__337en_1_1,dn)
& fact(ausschlie__337en_1_1,real)
& gener(ausschlie__337en_1_1,ge)
& sort(kapitalbeteiligung_1_1,ad)
& card(kapitalbeteiligung_1_1,int1)
& etype(kapitalbeteiligung_1_1,int0)
& fact(kapitalbeteiligung_1_1,real)
& gener(kapitalbeteiligung_1_1,ge)
& quant(kapitalbeteiligung_1_1,one)
& refer(kapitalbeteiligung_1_1,refer_c)
& varia(kapitalbeteiligung_1_1,varia_c)
& sort(kapital_2_1,nq)
& sort(beteiligung_1_1,ad)
& card(beteiligung_1_1,int1)
& etype(beteiligung_1_1,int0)
& fact(beteiligung_1_1,real)
& gener(beteiligung_1_1,ge)
& quant(beteiligung_1_1,one)
& refer(beteiligung_1_1,refer_c)
& varia(beteiligung_1_1,varia_c) ),
file('/export/starexec/sandbox2/tmp/tmp.06vzqZUFTL/E---3.1_28375.p',ave07_era5_synth_qa07_007_mira_news_1223) ).
fof(c_0_2,negated_conjecture,
~ ? [X1,X2,X3,X4,X5,X6,X7] :
( agt(X5,X4)
& attr(X1,X2)
& attr(X4,X3)
& attr(X6,X7)
& sub(X2,name_1_1)
& sub(X1,firma_1_1)
& sub(X3,name_1_1)
& val(X2,bmw_0)
& val(X3,bmw_0) ),
inference(assume_negation,[status(cth)],[synth_qa07_007_mira_news_1223]) ).
fof(c_0_3,negated_conjecture,
! [X8,X9,X10,X11,X12,X13,X14] :
( ~ agt(X12,X11)
| ~ attr(X8,X9)
| ~ attr(X11,X10)
| ~ attr(X13,X14)
| ~ sub(X9,name_1_1)
| ~ sub(X8,firma_1_1)
| ~ sub(X10,name_1_1)
| ~ val(X9,bmw_0)
| ~ val(X10,bmw_0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_4,negated_conjecture,
( ~ agt(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X2,X5)
| ~ attr(X6,X7)
| ~ sub(X4,name_1_1)
| ~ sub(X3,firma_1_1)
| ~ sub(X5,name_1_1)
| ~ val(X4,bmw_0)
| ~ val(X5,bmw_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,hypothesis,
val(c429,bmw_0),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1223]) ).
cnf(c_0_6,hypothesis,
sub(c429,name_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1223]) ).
cnf(c_0_7,hypothesis,
( ~ val(X1,bmw_0)
| ~ attr(X2,c429)
| ~ attr(X3,X4)
| ~ attr(X5,X1)
| ~ agt(X6,X2)
| ~ sub(X1,name_1_1)
| ~ sub(X5,firma_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6])]) ).
cnf(c_0_8,hypothesis,
( ~ attr(X1,c429)
| ~ attr(X2,c429)
| ~ attr(X3,X4)
| ~ agt(X5,X1)
| ~ sub(X2,firma_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_5]),c_0_6])]) ).
cnf(c_0_9,hypothesis,
attr(c428,c429),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1223]) ).
cnf(c_0_10,hypothesis,
( ~ attr(X1,c429)
| ~ attr(X2,X3)
| ~ agt(X4,c428)
| ~ sub(X1,firma_1_1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,hypothesis,
sub(c428,firma_1_1),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1223]) ).
cnf(c_0_12,hypothesis,
( ~ attr(X1,X2)
| ~ agt(X3,c428) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_11])]) ).
cnf(c_0_13,hypothesis,
agt(c6,c428),
inference(split_conjunct,[status(thm)],[ave07_era5_synth_qa07_007_mira_news_1223]) ).
cnf(c_0_14,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_9,c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.08/1.12 % Problem : CSR115+36 : TPTP v8.1.2. Released v4.0.0.
% 1.08/1.13 % Command : run_E %s %d THM
% 1.13/1.33 % Computer : n012.cluster.edu
% 1.13/1.33 % Model : x86_64 x86_64
% 1.13/1.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.13/1.33 % Memory : 8042.1875MB
% 1.13/1.33 % OS : Linux 3.10.0-693.el7.x86_64
% 1.13/1.33 % CPULimit : 300
% 1.13/1.33 % WCLimit : 300
% 1.13/1.33 % DateTime : Fri May 3 15:06:39 EDT 2024
% 1.13/1.33 % CPUTime :
% 2.27/2.50 Running first-order theorem proving
% 2.27/2.50 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.06vzqZUFTL/E---3.1_28375.p
% 2.36/2.71 # Version: 3.1.0
% 2.36/2.71 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.36/2.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.36/2.71 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.36/2.71 # Starting new_bool_3 with 300s (1) cores
% 2.36/2.71 # Starting new_bool_1 with 300s (1) cores
% 2.36/2.71 # Starting sh5l with 300s (1) cores
% 2.36/2.71 # new_bool_1 with pid 28455 completed with status 0
% 2.36/2.71 # Result found by new_bool_1
% 2.36/2.71 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.36/2.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.36/2.71 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.36/2.71 # Starting new_bool_3 with 300s (1) cores
% 2.36/2.71 # Starting new_bool_1 with 300s (1) cores
% 2.36/2.71 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.36/2.71 # Search class: FHHNF-FFMM32-SFFFFFNN
% 2.36/2.71 # partial match(1): FGHNF-FFMM32-SFFFFFNN
% 2.36/2.71 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.36/2.71 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 181s (1) cores
% 2.36/2.71 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 28458 completed with status 0
% 2.36/2.71 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 2.36/2.71 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.36/2.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.36/2.71 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.36/2.71 # Starting new_bool_3 with 300s (1) cores
% 2.36/2.71 # Starting new_bool_1 with 300s (1) cores
% 2.36/2.71 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.36/2.71 # Search class: FHHNF-FFMM32-SFFFFFNN
% 2.36/2.71 # partial match(1): FGHNF-FFMM32-SFFFFFNN
% 2.36/2.71 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.36/2.71 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 181s (1) cores
% 2.36/2.71 # Preprocessing time : 0.012 s
% 2.36/2.71 # Presaturation interreduction done
% 2.36/2.71
% 2.36/2.71 # Proof found!
% 2.36/2.71 # SZS status Theorem
% 2.36/2.71 # SZS output start CNFRefutation
% See solution above
% 2.36/2.71 # Parsed axioms : 10189
% 2.36/2.71 # Removed by relevancy pruning/SinE : 10129
% 2.36/2.71 # Initial clauses : 210
% 2.36/2.71 # Removed in clause preprocessing : 0
% 2.36/2.71 # Initial clauses in saturation : 210
% 2.36/2.71 # Processed clauses : 430
% 2.36/2.71 # ...of these trivial : 0
% 2.36/2.71 # ...subsumed : 0
% 2.36/2.71 # ...remaining for further processing : 430
% 2.36/2.71 # Other redundant clauses eliminated : 0
% 2.36/2.71 # Clauses deleted for lack of memory : 0
% 2.36/2.71 # Backward-subsumed : 8
% 2.36/2.71 # Backward-rewritten : 0
% 2.36/2.71 # Generated clauses : 130
% 2.36/2.71 # ...of the previous two non-redundant : 129
% 2.36/2.71 # ...aggressively subsumed : 0
% 2.36/2.71 # Contextual simplify-reflections : 0
% 2.36/2.71 # Paramodulations : 129
% 2.36/2.71 # Factorizations : 0
% 2.36/2.71 # NegExts : 0
% 2.36/2.71 # Equation resolutions : 0
% 2.36/2.71 # Disequality decompositions : 0
% 2.36/2.71 # Total rewrite steps : 3
% 2.36/2.71 # ...of those cached : 1
% 2.36/2.71 # Propositional unsat checks : 0
% 2.36/2.71 # Propositional check models : 0
% 2.36/2.71 # Propositional check unsatisfiable : 0
% 2.36/2.71 # Propositional clauses : 0
% 2.36/2.71 # Propositional clauses after purity: 0
% 2.36/2.71 # Propositional unsat core size : 0
% 2.36/2.71 # Propositional preprocessing time : 0.000
% 2.36/2.71 # Propositional encoding time : 0.000
% 2.36/2.71 # Propositional solver time : 0.000
% 2.36/2.71 # Success case prop preproc time : 0.000
% 2.36/2.71 # Success case prop encoding time : 0.000
% 2.36/2.71 # Success case prop solver time : 0.000
% 2.36/2.71 # Current number of processed clauses : 211
% 2.36/2.71 # Positive orientable unit clauses : 165
% 2.36/2.71 # Positive unorientable unit clauses: 0
% 2.36/2.71 # Negative unit clauses : 1
% 2.36/2.71 # Non-unit-clauses : 45
% 2.36/2.71 # Current number of unprocessed clauses: 119
% 2.36/2.71 # ...number of literals in the above : 144
% 2.36/2.71 # Current number of archived formulas : 0
% 2.36/2.71 # Current number of archived clauses : 219
% 2.36/2.71 # Clause-clause subsumption calls (NU) : 2509
% 2.36/2.71 # Rec. Clause-clause subsumption calls : 730
% 2.36/2.71 # Non-unit clause-clause subsumptions : 1
% 2.36/2.71 # Unit Clause-clause subsumption calls : 23
% 2.36/2.71 # Rewrite failures with RHS unbound : 0
% 2.36/2.71 # BW rewrite match attempts : 0
% 2.36/2.71 # BW rewrite match successes : 0
% 2.36/2.71 # Condensation attempts : 0
% 2.36/2.71 # Condensation successes : 0
% 2.36/2.71 # Termbank termtop insertions : 51321
% 2.36/2.71 # Search garbage collected termcells : 39025
% 2.36/2.71
% 2.36/2.71 # -------------------------------------------------
% 2.36/2.71 # User time : 0.072 s
% 2.36/2.71 # System time : 0.052 s
% 2.36/2.71 # Total time : 0.124 s
% 2.36/2.71 # Maximum resident set size: 42584 pages
% 2.36/2.71
% 2.36/2.71 # -------------------------------------------------
% 2.36/2.71 # User time : 0.106 s
% 2.36/2.71 # System time : 0.064 s
% 2.36/2.71 # Total time : 0.170 s
% 2.36/2.71 # Maximum resident set size: 10792 pages
% 2.36/2.71 % E---3.1 exiting
% 3.20/2.71 % E exiting
%------------------------------------------------------------------------------